Proving a Language Non-Regular via the Pumping Lemma

Every regular language has a pumping length p such that any long string splits as xyz with y pumpable; find one long string whose every legal split breaks membership, and the language cannot be regular.