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 res(n, s):
    a = str(n)
    b = str(s)
    n_len = len(a)
    s_len = len(b)
    san = n
    sandar = []
    for i in range(n_len):
        sandar.append(san%10)
        san = san//10
    sum_n = sum(sandar)
    if(sum_n <= s):
        return 0
    else:
        k = s
        total = 0
        for i in range(n_len):
            if sandar[n_len-1-i]<k:
                k = k - sandar[n_len-1-i]
            else:
                if n_len-i >= n_len:
                    return 10**(n_len-s_len + 1) - n
                else:
                    sandar[n_len-i] += 1
                    for j in range(i):
                        total += sandar[n_len-1-j]*(10**(n_len-1-j))
                    return total-n
            
n = int(input())
reuslt = []
for i in range(n):
    data = list(map(int, input().split()))
    reuslt.append(res(data[0], data[1]))
for i in range(n):
    print(reuslt[i])