Proving a language is not regular using Myhill Nerode Theorem
Take $a^nb$ and $a^mb$ for n != m. Since the first can be followed by $a^n$ and the second can’t, they are in different equivalence classes. Therefore the number of equivalence classes is not finite. 

C isn’t even needed.