For the following language, prove it is not context-free using pumping lemma for CF languages.

The language of all strings over the alphabet {a, b, c} such that there is an equal number of as, bs and cs, and all as come before all bs and all bs come before all cs.