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 dgt_sum(num):
    return sum([int(x) for x in str(num)])

def clps(val, left=0):
    if len(str(val)) == 1:
        return 1, left + 1


    return int(str(val)[:-1]) + 1, left + 1


def solve(n, s):
    n_str =str(n)
    _s = 0
    target = n
    for i, d in enumerate(n_str):
        d = int(d)
        _s+=d
        if _s > s:
            cl = int(n_str[:i+1]), 0
            while dgt_sum(cl[0]) > s:
                cl = clps(*cl)

            target = cl[0] * pow(10, cl[1] + len(n_str) -i-1)
            break

    return target - n



for _ in range(t):
    n,s = [int(x) for x in input().split(' ')]
    print(solve(n,s))