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,k=[int(x)for x in input().split()]
    t=n
    a=[]
    while(t):
        a.append(t%10)
        t//=10
    a=a[::-1]
    ss=sum(a)
    if(k>=ss):
        print(0)
    elif(a[0]>k):
        print(10**(len(a))-n)
    else:
        i=0
        b=0
        while(b+a[i]<k):
            b+=a[i]
            i+=1
        t=i
        i-=1
        while(i>=0):
            if(a[i]!=9):
                a[i]+=1
                break
            i-=1
        if(i==-1):
            print(10**(len(a))-n)
        else:
            ss=0
            for j in range(i+1,len(a)):
                a[j]=0
            for i in a:
                ss=ss*10+i
            print(ss-n)