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:
for _ in range(int(input())):
    n,s=map(int,input().split())
    l=[]
    while(n>0):
        l.append(n%10)
        n=n//10
    #print(l)
    ts=sum(l)
    ans=0
    l1=[]
    c=0
    f=0
    if(ts<=s):
        print(0)
    else:
        j=0
        #print(l)
        for i in range(len(l)):
            if(l[i]==0):
                l1.append(0)
            else:
                j=i
                break
        #print(l)
        for i in range(j,len(l)):
            
            if(l[i]==0):
                l1.append(9)
                l[i]=0
                c=1
            elif(l[i]==9 and c==1):
                l1.append(0)
                l[i]=0
                c=1
            elif(l[i]==9 and c==0):
                l1.append(1)
                l[i]=0
                c=1
            else:
                l1.append(10-l[i]-c)
                l[i]=0
                c=1
            if(c+sum(l)<=s):
                break
        i=len(l1)-1
        while(l1[i]==0):
            l1.pop()
            i-=1
        for i in range(len(l1)-1,-1,-1):
            print(l1[i],end="")
        print()