Use pumping lemma to show the following languages are not regular:

L1={0^n 1^m 2^m | n>= 1, m>= 1}

L2 ={a^i b^j c^k | i=1}