Recall the theorem that the union of countable sets is countable (in fact, the countable union of countable sets is countable).

note that the set we wish to prove is countable can be written as

now show that each of these are countable, shouldn't be that hard. then apply the theorem

you can show a set is countable by showing that there exists a bijection between the set and the natural numbers.