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:
def sumnum(x):
    a = 0
    for i in x:
        a += int(i)
    return a
def plone(lst):
    n = 0
    for i in lst:
        n *= 10
        n += int(i)
    n += 1
    newlst = list(str(n))
    return newlst
def solve():
    n, s = input().split()
    s = int(s)
    lst = list(n)
    prefzero = True
    ans = []
    while len(lst):
        if prefzero and sumnum(lst) <= s:
            break
        if not prefzero and sumnum(plone(lst)) <= s:
            break
        if lst[-1] == 0:
            lst.pop()
        else:
            lst.pop()
            prefzero = False
        ans.append(0)
    if not prefzero:
        #print(lst)
        lst = plone(lst)
    k = 0
    for i in lst:
        k *= 10
        k += int(i)
    for i in ans:
        k *= 10
    print(k - int(n))
for i in range(int(input())):
    solve()