Question
Step Snap
Kael has two integers X and Y. In one move, he can increment X by 1. Determine the minimum number of moves needed to make X divisible by Y.
Input
The first line of the input contains two integers X and Y.
Constraints
1 ≤ X, Y ≤ 1012
Constraints
1 ≤ X, Y ≤ 1012
Output
Print the minimum number of moves required to make X divisible by Y.
Example
Sample Input
17 8
Sample Output
7
17 8
Sample Output
7