[math-fun] Puzzler

I give you an arbitrary positive integer x > 0. You write down x, 2x, 3x, 4x, ..., kx in decimal. How large much k be to guarantee that every digit appears somewhere in your list, regardless of x?