Using pumping lemma prove the following languages are non-regular

C={0n1m0nm,n0} F={0n1n2nn0}