is a^(m)b^(n) | m >= 99 and n>=999 a regular language? I've been stuck on this problem for a while. Say we have the following language?

a^(m)b^(n) | m &gt;= 99 and n&gt;=999


I'm trying to use the pumping lemma to prove that it isn't regular because intuitively to me it seems like it isn't. Can anyone please give me a concrete answer?
The language is regular here is a regular expression that fits for the language:

$$a^*(\underbrace{aa\dots}_{\text{99 times}})b^*(\underbrace{bbb\dots}_{\text{999 times}})$$
The language is the language accepted by the regular expression /aa...aa*bb...bb*/ where the number of a and b hiding in the dots is adjusted to needs.