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:
'''Author- Akshit Monga'''

def bfs(n,s):
    for i in range(0,10**18):
        var=n+i
        sum=0
        for i in str(var):
            sum+=int(i)
        if sum<=s:
            return var-n


t = int(input())
for _ in range(t):
    n,s=map(int,input().split())
    no=str(n)
    sum=0
    # print(bfs(n,s))
    for i in no:
        sum+=int(i)
    if sum<=s:
        print(0)
        continue
    temp=no[::-1]
    for i in range(len(temp)-1):
        # print(temp)
        if temp[i]=='0':
            continue
        new=temp[:i]+'0'+temp[i+1:]
        # print(new)
        for j in range(i+1,len(new)):
            if new[j]!='9':
                pivot=j
                break
        else:
            pivot=len(new)-1
        var=''
        # print(pivot)
        for j in range(len(new)):
            if j<pivot:
                var+='0'
            elif j==pivot:
                if len(str(int(new[j])+1))==1:
                    var+=str(int(new[j])+1)
                else:
                    var+=str(int(new[j])+1)[::-1]
            else:
                var+=new[j]

        c=0
        # print(var)
        for j in var:
            c += int(j)
        if c<=s:
            print(-n+int(var[::-1]))
            break
        temp=var
    else:
        var=len(temp)
        print(-n+10**(var))