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 ii in range(t):
    n,s=map(int,input().split())
    num=[int(i) for i in str(n)]
    if sum(num)<=s:
        print(0)
    else:
        i,k=len(num)-1,0
        while i>-1:
            if num[i]!=0:
               num[i]=0
               k=i
            l=-2
            for l in range(k-1,-1,-1):
                if num[l]!=9:
                    num[l]+=1
                    break
                else:
                    num[l]=0
            if l>-2:
                i=l
            else:
                i-=1 
            if sum(num)<=s and int(''.join(map(str,num)))>=n:
                tmp=int(''.join(map(str,num)))
                sys.stdout.write(str(tmp-n)+'\n')
                break
        else:
            num.insert(0,1)
            tmp=int(''.join(map(str,num)))
            sys.stdout.write(str(tmp-n)+'\n')