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:
def digsum(n):
    summ=0
    while n:
        summ+=n%10
        n//=10
    return summ
t=int(input())
for i in range(t):
    n,s=map(int,input().split())
    if digsum(n)<=s:
        print(0)
    else:
        n1=n
        n_str="0"+str(n)
        n2=[]
        for char in n_str:
            num=int(char)
            n2.append(num)
        l=len(n2)
        for j in range(len(n2)):
            n2[l-1]=0
            n2[l-2]+=1
            if sum(n2)<=s:
                break
            l-=1
        n2=n2[::-1]
        n3=0
        for i in range(len(n2)):
            n3+=(n2[i]*(10**i))
        print(n3-n1)