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 x in range(int(input())):
    a,b=map(int,input().split())
    c=a
    a=list('0'+str(a))
    arr=[]
    b=b-(ord(a[0])-48)
    t=1
    f=0
    while(b>=0):
        arr.append(b)
        b=b-(ord(a[t])-48)
        t+=1
        if t==len(a):
            f=1
            break
    arr.append(b)
    for i in range(len(a)-len(arr)-1,-1,-1):
        arr.append(0)
    if f==1 and b>=0:
        print(0)
    else:
        s1=""
        f=0
        t=1
        k=0
        for i in range(len(arr)-1,0,-1):
            if(arr[i]<=0 and f==0):
                s1+='0'
            else:
                f=1
                if t:
                    k=(len(arr)-i-1)
                    t=0
                s1+=a[i]
        if int(s1)==0:
            s1=s1+'1'
        ans=int(s1[::-1])
        if k>0:
            ans+=pow(10,k)
        print(ans-int(''.join(a)))