Pumping lemma: find the string that makes the language not regular

1) L₃ = {aⁱ b^j c^k | i= 1}

2) L₁ = {0ⁿ 1^m 2^m | n >= 1, m >= 1}

Please show step by step so I can understand. Thanks!