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:
def sum_s(s):
    ans = 0
    for i in s:
        ans+=i
    return ans

t = int(input())
while t:
    t-=1
    n, s = map(int, input().split())
    # n = list(str(n))
    l = []
    s1 = str(n)
    for i in s1:
        l.append(int(i))
    n = l
    if sum_s(n)<=s:
        print(0)
        continue
    steps = 0
    n1 = len(n)
    i = 0
    n.reverse()
    curr = 1
    # print(n)
    while i<n1:
        if n[i]!=0:
            steps+= (10-int(n[i]))*curr
            n[i] = 0
            present = False
            for j in range(i+1, n1):
                if n[j]==9:
                    n[j] = 0
                else:
                    present = True
                    n[j] = n[j]+1
                    break
            if not present:
                break
        i+=1
        if sum_s(n)<=s:
            break
        curr*=10
    print(steps)