How to show that this language is not regular with pumping lemma?


Being L={a^x b^y c^z: x=2y ∨ y>z I have to prove that this language is not regular, making use of the Pummping Lemma, I know that for that, I have to assume that L is regular, then I know that there is a p such that every w in L such that |w| >= p can be represented as x and z with |y| != 0 and |xy| <= p. But I have not been able to choose a w in L that serves me to finish with the lemma, taking into account the restrictions that L has.