Is this language a context free language?

Consider the following language, where the alphabet is {0, 1, 2}:
B = {0^a, 1^b, 2^c
|a, b, c ≥ 0 and c = ab + 1}.

Is this language a context free language? Prove your answer.

I am having trouble using the pumping lemma of context free languages to show if this language is context free? Can anyone give me any tips or advice on how to approach this problem? Thanks in advance!