MinAdd

Chef loves problems about digits and he came up with an interesting one. Chef has given you two integers $N$ and $K$. You should find the **minimum** non-negative integer $X$, such that $N + X$ has **at most** $K$ distinct digits in its decimal representation. For example, $1231$ has three distinct digits and $100$ has two distinct digits. ### Input - The first line of input will contain a sing