Using the pumping lemma for regular languages show that the following language is not regular

L1 = {0^m 1^ (m+1) 0| m > 0}