Language that is CFL by Odgen but not by pumping lemma

Question

I recently studied about Odgen's lemma and the pumping lemma. I deduced that Ogden's lemma is a general form and was interested: Is there a CFL language by Odgen's but not by the pumping lemma?

Answer 1

For example the language $L = \{a^q 0^n1^m2^p \mid q = 0 \text{ or } n=m=p \}$. We can mark all symbols but the $a$.