Use pumping lemma to prove the language is not regular

Language over string {a,b,c} with the number of as is greater or equal to the number of b plus the number of c}