Problem: You are given a positive integer n. In one move, you can increase n by one (i.e. make n := n + 1). Your task is to find the minimum number of moves you need to perform in order to make the sum of digits of n be less than or equal to s.

You have to answer t independent test cases.

Input

The first line of the input contains one integer t (1 ≤ t ≤ 2 ⋅ 10^4) — the number of test cases. Then t test cases follow.

The only line of the test case contains two integers n and s (1 ≤ n ≤ 10^{18}; 1 ≤ s ≤ 162).

Output

For each test case, print the answer: the minimum number of moves you need to perform in order to make the sum of digits of n be less than or equal to s.

Example

Input


5
2 1
1 1
500 4
217871987498122 10
100000000000000001 1


Output


8
0
500
2128012501878
899999999999999999

Solution (in PYTHON3):

Solution:
t = int(input())


def f(temp_n):
    total = 0
    while temp_n > 0:
        total+= temp_n%10
        temp_n = temp_n//10
    return total

for _ in range(t):
    n , target = map(int, input().split())
    pw = 1
    res = 0
    while f(n) > target:
        digit = (n // pw) % 10
        add = pw * ((10 -digit) % 10)
        n+= add
        res+= add
        pw *= 10
    
    print(res)