Suppose we are
given two numbers X and Y. We will append digits
(«0», «1», …«9») to X (at the end) until the resulting
number is divisible by Y.
Example. Let X=13,
Y=666. After appending digits 3 and 2 to X we have
number 1332, which is divisible by 666.
Write a program
to determine the minimum number of digits that is required to transform X
into a number divisible by Y by appending digits on the right.
Limitations
1 <=
X, Y <=
1 000 000 000.
Input
The first line
contains the original numbers X and Y.
Output
A single integer
– the minimum number of digits to be appended to X – must be written
to the output file.
Sample
|
Standard input
|
Standard output
|
|
13 666
|
2
|
