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,s=map(int,input().split())
    st=str(n)
    p=[0]*(len(st))
    for i in range(len(st)-1,-1,-1):
        p[i]+=int(st[i])
        if(i+1<len(p)):
            p[i]+=p[i+1]
       
    if p[0]<=s:
        print(0)
        continue
    last=0
    moves=float('inf')
    for j in range(len(p)-1,-1,-1):
        last+=int(st[j])
        val=p[0]-last+1 
        if val<=s:
            if j-1>=0:
                newnum=int(st[:j-1]+str(int(st[j-1])+1)+'0'*(len(st)-j))
                #print(newnum)
                moves=min(moves,newnum-n)
            else:
                newnum=int('1'+'0'*(len(st)))
                #print(newnum)
                moves=min(moves,newnum-n)
    print(moves)