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 os,io
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
def get_digits(n):
    s = []
    v = 0
    while n:
        s.append(n%10)
        v+=1
        n //= 10
    return v,s,sum(s)

cases = int(input())
output = ''
for t in range(cases):
    n,s = list(map(int,input().split()))
    num,dig,sd = get_digits(n)
    if sd <= s:
        print(0)
    else:
        i=0
        while sd>=s:
            sd -= dig[i]
            dig[i]=0
            i+=1
        if i<=num-1:
            dig[i]+=1
            while dig[i]==10:
                dig[i]=0
                if i+1<=num-1:
                    dig[i+1]+=1
                else:
                    dig.append(1)
                i+=1
        else:
            dig.append(1)
        dig = int(''.join(map(str,dig[::-1])))
        print(dig - n)