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:
t = int(input())

def int_to_arr(n, s):
    arr = []
    n_copy = n
    while n_copy > 0:
        arr.append(n_copy % 10)
        n_copy = n_copy // 10
    #print(arr)
    return trying(arr, n, s)

def trying(arr, n, s):
    summa = 0
    for i in range(len(arr) - 1, -1, -1):
        summa += arr[i]
        #print('summa:', summa)
        if summa > s:
            need = 10 ** (i+1) - n % 10 ** (i+1)
            #print('need', need)
            #print('n:', n)
            to_add[0] += need
            n += need
            int_to_arr(n, s)
            return
    print(to_add[0])

for _ in range(t):
    to_add = [0]
    n, s = map(int, input().split())
    int_to_arr(n, s)