# Check if it is regular language

I have a language $L = \{ a^i b^j c^k \mid i \geq 1 \land j \geq 1 \land k \geq 1 \land (i \neq j \lor j \neq k) \}$ and how to check if it is regular language? I tried using pumping lemma for regular languages, but I have no idea which word I should choose.