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 abc(n,m):
    c=0
    a="0"
    b=""
    for j in str(n):
        c+=int(j)
        if c>=m:
            b+='0'
            
        else:
            a+=j
    c=""
    flag=1
    for j in a[-1::-1]:
        if flag:
            if j=='9':
                c+='0'
            else:
                c+=str(int(j)+1)
                flag=0
        else:
            c+=j
    if flag:
        c+='1'
    return int(c[-1::-1]+b)-n
        
def sum(n):
    c=0
    while n>0:
        c+=n%10
        n=n//10
    return c
t=int(input())
for _ in range(t):
    n,m=map(int,input().split())
    if sum(n)<=m:
        print(0)
        continue
    #i=0
    #x=str(n)
    #c=0
    #while i<len(x) and c<m:
        #c+=int(x[i])
        #i+=1
    #ans=x[i:]
    #print(ans,"  VV ")
    #c=x[:i]
    #print(c)
    print(abc(n,m))