Use the pumping lemma for regular languages to prove that the following language is not regular

{aⁿbⁿc^q | n>=0 & p>=0 & q>=0 & p>=n & p>=q}