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

T=int(input())
for _ in range(T):
    n,s=map(int,input().split())
    v=str(n)

    A=[]
    cs=0
    for i in range(len(v)):
        cs=cs+int(v[i])
        A.append(cs+1)
    
    ans=int('1'+'0'*len(v))-n
    #print(A)
    for i in range(len(v)):
        if (A[i]>s):
            if (i>0):
                st=v[:i-1]+str(int(v[i-1]))+('0'*(len(v)-i))
                vv=int(st)
                val=pow(10,len(v)-i)
                rv=val-(vv%val)
                st=vv+rv
                #print(st)
                ans=st-n
            break

    sv=0
    for i in range(len(v)):
        sv=sv+int(v[i])
        
    if (sv<=s):
        ans=0
    print(ans)