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())
for _ in range(t):
    a, b = map(int, input().split())
    start_a = a
    t = 0
    s = 0
    for i in str(a):
        s += int(i)
    while(s > b):
        s = 0
        for i in str(a):
            s += int(i)
            if s > b:
                break
        if s > b:
            a = (a // 10 ** (len(str(a)) - 1) + 1) * (10 ** (len(str(a)) - 1))
    f_ans = 0
    r = a - start_a
    answer = r
    for i in range(0, len(str(r))):
        s = 0
        some_a = start_a + int(str(r)[i:])
        for j in str(some_a):
            s += int(j)
        if s <= b and some_a - start_a >= 0:
            answer = str(r)[i:]
    print(answer)