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:
for case in range(int(input())):
    n, s = [int(x) for x in input().split()]

    cur = [int(x) for x in str(n)]
    cur.insert(0, 0)
    # print(cur)

    ans = int(1e19)

    temp = [x for x in cur]
    if sum(temp) <= s:
        print(0)
        continue
    
    for i in range(len(cur)-1, 0, -1):
        if temp[i] == 0:
            continue
        temp[i] = 0
        j = i-1
        while temp[j] == 9:
            temp[j] = 0
            j -= 1
        temp[j] += 1
        
        # print(i)
        # print(temp)
        # print()

        if sum(temp) <= s:
            temp2 = [str(x) for x in temp]
            print(int("".join(temp2)) - n)
            break