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:
testcases = int(input())
for testcase in range(testcases):
    temparr = input()
    temparr = temparr.split()
    #print(temparr)
    a = temparr[0]
    a = a[::-1]
    b = int(temparr[1])
    arr = []
    for i in a:
        arr.append(int(i))
    arr.append(0)
    ans = []
    cursum = sum(arr)
    # print("testcase")
    # print(arr)
    # print("b")
    # print(b)
    if cursum <= b :
        print(0)
        continue
    nn = len(arr)
    carry = 0 
    for i in range(nn - 1):
        if arr[i] == 0:
            ans.append("0")
            continue 
        else:
            diff = 10 - arr[i] 
            ans.append(str(diff))
            arr[i] = 0 
            j  = i + 1
            arr[i + 1] += 1 
            while j < nn:
                if arr[j] == 10 :
                    arr[j] = 0  
                    arr[j + 1] += 1 
                    j += 1 
                    continue  
                else:
                    break 
        cursum = sum(arr)
        if cursum <= b :
            break 
    #print(ans)
    ans = ans[::-1]
    print("".join(ans))