IR-TST 2010 Problem 12

Prove that for each natural number $m$ , there is a natural number $N$ such that for each $b$ that $2\leq b\leq1389$ sum of digits of $N$ in base $b$ is larger than $m$ .