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:
import sys
input = sys.stdin.readline
for _ in range(int(input())):
    a,b=[(x) for x in input().split()]
    b=int(b)
    temp=[int(i) for i in a]
    n=len(a)
    i=n-1
    curr=sum(temp)
    while curr>b:
        #print(temp,curr)
        now=temp[i]
        if now==0 and i!=0:
            i-=1
        elif curr-now+1>b and i!=0:
            curr-=(now-1)
            temp[i]=0
            temp[i-1]+=1
            i-=1
        elif i==0:
            #temp[i]=0
            #curr-=temp[i]
            temp[i]=0
            temp=[1]+temp
            break
        else:
            curr-=(now-1)
            temp[i]=0
            temp[i-1]+=1
            break
    ans=0
    for i in temp:
        ans=10*ans+i
    #print(temp)
    print(ans-int(a))