For each positive integer $n$, let $s(n)$ be the sum of the digits of $n$. Find the smallest positive integer $k$ such that \[ s(k) = s(2k) = s(3k) = \cdots = s(2013k) = s(2014k). \]

Let's think step by step and output the final answer within \boxed{}.
user