Note that $(\sqrt{m} - \sqrt{m-1}) \downarrow 0$, so for $\varepsilon > 0$, there exists $M(\varepsilon)$ such that for every $ m \ge M$,
$$(\sqrt{m} - \sqrt{m-1}) < \varepsilon$$
Suppose that the rational number is $q = 0.a_1a_2...a_l$ with $a_i \in \{0,...,9\}$. Then, let $\varepsilon < 10^{-(l+1)}$ and WLOG letting $M(\varepsilon) = k^2$ be a square for convenience, consider $[\sqrt{m} ]$ for $n = k^2, ..., (k+1)^2-1$, where $[x]$ is taken to denote the fractional part of $x \in \mathbb{R}$. Further WLOG let $M$ be sufficiently large such that $[\sqrt{(k+1)^2-1}] > q+ \varepsilon$.
Then, $([\sqrt{m}])$ is an increasing sequence of numbers in $[0,1]$ which exceeds $q+\varepsilon$, but with the consecutive difference strictly upper-bounded by $\varepsilon$. Hence, we must have an element of the sequence in $[q, q+ \varepsilon]$, which will therefore have the same first $l$ digits as $q$ in its decimal expansion.
Thus, $\sqrt{m}$ as above and $n = -\lfloor \sqrt{m} \rfloor$ is sufficient.
Not as clever as Adam's answer, but to its credit, this approach is constructive.