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:
from sys import stdin,stdout
def fn(s,n):
    p=0
    for i in range(n-1,-1,-1):
        if s[i]!='0':
            p=i
            break
    if p==0:return '1'+'0'*n
    num=int(s[:p])+1
    return str(num)+'0'*(n-p)

def SOD(s):
    return sum([int(v) for v in s])
n=0
for _ in range(int(stdin.readline())):
    # n=int(stdin.readline())
    s,sm=list(map(int,stdin.readline().split()))
    s=str(s);ori_s=s;n=len(s)
    sod=SOD(s);ns=s
    while sod>sm:
        ns=fn(ns,n)
        sod=SOD(ns)
        # print(ns)
    print(int(ns)-int(ori_s))