Create a pumping lemma for this language

C = {w | w is a string over {a, b}, all a comes after all b, and |w| > 1 }