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:
t=int(input())
for i in range(0,t):
    a,b=map(int,input().split())
    c=a
    a1=str(a)
    yy=len(a1)
    summ=0
    a2=[]
    for j in range(0,yy):
        summ=summ+int(a1[j])
        a2.append(int(a1[j]))
    #print(a2)
    if(summ<=b):
        print(0)
    else:
        s1=summ-b
        j=yy-1
        while(j>=0):
            s1=s1-int(a1[j])
            
            a2[j]=0
            if(j!=0):
                if(a1[j-1]!='9'):
                    a2[j-1]+=1
                else:
                    while(a1[j-1]=='9'):
                        a2[j-1]=0
                        s1=s1-9
                        j-=1
                        if(j==0):
                            break
                    if(j>0):
                        a2[j-1]+=1
                    else:
                        a2.insert(0,1)
                    
            else:
                a2.insert(0,1)
            ##print(a2)
            #print(j)
            #print(s1)
            if(s1<0):
                break
           
            j-=1
        str1=""
        for ii in a2:
            str1=str1[0:]+str(ii)
        #print(str1)
        a22=int(str1)
        print(a22-a)