Prove that the language L = { a^m b^m cⁿ | n > 2m 0 } is not context-free.

I can't figure out how to approach these questions. It's fairly easy to understand when all the variables can be the same but what do I do when n has to be larger than 2m? I can't make them all equal to p.....Please help and show the steps clearly.