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 digsum(n):
    ret = 0
    while n > 0:
        ret += (n%10)
        n = n//10
    return ret
def solve():
    n,s = map(int,input().split())
    ans = 0
    i = 0
    while digsum(n) > s and i < 20:
        d = n%pow(10,i+1)
        d = digsum(d)
        if d != 0:
            n += (10-d)*pow(10,i);
            ans += (10-d)*pow(10,i)
        i+=1
#    n = list(map(int, list(str(n)[::-1])))
#    ss = 0
#    for x in n:
#        ss += int(x)
#    ans = 0
#    for i in range(len(n)):
#        if n[i] == 0: continue
#        if(ss <= s):break
#        d = (10 - n[i])
#        j = i+1
#        while j < len(n) and n[j] == 9:
#            n[j] = 0
#        if j < len(n):
#            n[j] += 1
#        ss = sum(n)
#        ans = (ans + d*pow(10,i))
    print(ans)


for _ in range(int(input())):
    solve()