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())

while t:
    n,num=map(int, input().split())
    s=str(n)
    a=[]
    ans=[0]

    for i in s:
        p=int(i)
        a.append(p)
        ans.append(0)

    # x=num

    # for i in range(1,len(ans)):
    #     p=a[i-1]
    #     if p==x:
    #         if s[i:]=='' or int(s[i:])==0:
    #             ans[i]=p
    #             break
    #         else:
    #             ans[i-1]=ans[i-1]+1
    #             break
    #     elif p>x:
    #         ans[i-1]=ans[i-1]+1
    #         break
    #     else:
    #         ans[i]=p
    #         x=x-p
        
    #     if x==0:
    #         break

    # if ans[0]==0:
    #     ans.pop(0)

    # final=''
    # for i in range(0,len(ans)):
    #     final=final+str(ans[i])

    # final=int(final)

    # print (final-n)

    i=len(a)-1
    count=0
    mul=1
    check=0

    # print (a)

    while i>0:
        if sum(a)>num:
            count=count+(10-a[i])*mul
            a[i]=0
            a[i-1]=a[i-1]+1
            i=i-1
            mul=mul*10

            if sum(a)<=num:
                check=1
                break
        else:
            check=1
            break

    if check:
        print (count)
    elif sum(a)<=num:
        print (0)
    else:
        print (mul*10-n)
        


    

    

    t=t-1