RIOPLATENSE 1999 Problem 2

Let $p_1, p_2, ..., p_k$ be $k$ different primes. We consider all positive integers that use only these primes (not necessarily all) in their prime factorization, and arrange those numbers in increasing order, forming an infinite sequence: $a_1 < a_2 < ... < a_n < ...$ Prove that, for every number $c$ , there exists $n$ such that $a_{n+1} -a_n > c$ .