RO-TST 2003 Problem 18

For every positive integer $n$ we denote by $d(n)$ the sum of its digits in the decimal representation. Prove that for each positive integer $k$ there exists a positive integer $m$ such that the equation $x+d(x)=m$ has exactly $k$ solutions in the set of positive integers.