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 ssum(n):
    csum = 0
    lst = []
    while n != 0:
        n, r = divmod(n, 10)
        csum += r
        lst.append(r)
    return lst, csum


def solve(n, s, csum, start, steps):
    if csum <= s:
        return steps
    if n[start] == 0:
        return solve(n, s, csum, start+1, steps)
    steps += (10-n[start])*(10**start)
    csum -= n[start] - 1
    n[start] = 0
    n[start+1] += 1
    return solve(n, s, csum, start+1, steps)


t = int(input())

for _ in range(t):
    n, s = (int(x) for x in input().split())
    lst, csum = ssum(n)
    lst.append(0)
    print(solve(lst, s, csum, 0, 0))