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:
# cook your dish here
def sumofdigits(n):
    n=str(n)
    sum1=0
    for i in n:
        sum1+=int(i)
    return sum1 
def satisfy(p2,s,n1):
    if(sumofdigits(int(p2)+n1)<=s):
        return 1
    else:
        return 0
for i in range(int(input())):
    n,s=list(map(int,input().split()))
    n1=n
    sum1=sumofdigits(n)
    if(sum1<=s):
        print(0)
    elif(s==1):
        size=len(str(n))
        d=pow(10,size)
        print(d-n1)
    else:
        n1=str(n)
        sum1=1
        for i in range(0,len(n1)):
            sum1+=int(n1[i])
            #print("sum1:"+str(sum1))
            if(sum1>s):
                f=i
                break
        length=len(n1)-f
        #print(length)
        power=pow(10,length)
        lst=n1[f:]
        #print(lst)
        print(power-int(lst))