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:
T = int(input())
def addn(N,k):
    val=0
    j=1
    for i in N[::-1]:
        val+=i*j
        j*=10
    val+=k
    val=list(str(val))
    val =[int(i) for i in val]
    return val
def sumd(N):
    ans=0
    for i in N:
        ans+=i
    return ans
while T>0:
    T-=1
    N = input()
    N = N.split(' ')
    
    s=int(N[1])
    n=int(N[0])
    val = 0
    ans=0
    N = list(N[0])
    N = [int(x) for x in N]
    for i in N:
        val+=i
    i=len(N)-1
    while val>s:
        if N[i]!=0:
            val-=N[i]
            ans+=(10-N[i])*pow(10,len(N)-i-1)
            N = addn(N,(10-N[i])*pow(10,len(N)-i-1))
            val = sumd(N)
        #print(N)
        i-=1
    print(ans)