Using pumping lemma to prove a language is not context free
The pumping lemma claims that if the language is context-free, then there exists a configuration such that you can pump the string. Therefore, to prove that the language isn't context-free, you must show that pumping fails for every possible arrangement.