We’re preparing your current view and syncing the latest data.
You are given two integers n and k. In one operation, you can add 1 to n. Your task is to find the minimum number of operations required to make n divisible by k.
The input consists of two integers n and k.
Output a single integer — the minimum number of operations required to make n divisible by k.
1 ≤ n, k ≤ 10^9
Example 1
Input
17 5
Output
3
Explanation
Since 17 mod 5 equals 2, adding 3 makes it divisible by 5.