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 plus(it):
    global f
    if f[it] == 9:
        f[it] = 0
        plus(it+1)
    else:
        f[it]+=1

def get_int(f):
    j = 0
    for i in range(len(f)):
        j += f[i] * 10**i
    return j

t = int(input())
m = 19
for qw in range(t):
    f = [0 for i in range(m)]
    n, s = input().split()
    s = int(s)
    for i in range(len(n)-1, -1, -1):
        f[i] = int(n[len(n)-1-i])

    g = f.copy();
    for i in range(m):
        sm = sum(f)
        if sm <= s:
            print(get_int(f) - get_int(g))
            break
        f[i] = 0
        plus(i+1)