Context Free or Context Sensitive and why
Hint 1: You can write the languages as $0^k1^k0^k0^{m-k}$ and $a^mb^mb$. 

Hint 2: If a language looks non-context-free, but the pumping lemma does not show this, you can try Ogden's lemma.