Let $L=\{a^mb^nc^k\mid k\le \min(m,n)\}$
$L$ can be pumped with the pumping lemma for Context Free Languages which makes it very difficult to prove it is not a Context Free Language.
Any idea how to prove such a tricky case?
This is homework of course.