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:
"""
Author: Q.E.D
Time: 2020-09-04 11:09:04
"""
T = int(input())
for _ in range(T):
    line = input()
    n, s = line.split()[:2]
    a = [int(c) for c in n]
    s = int(s)
    t = sum(a)
    if t <= s:
        ans = 0
    else:
        for i, p in enumerate(range(len(a))[::-1]):
            if p > 0:
                a[p - 1] += 1
                t += 1
            t -= a[p]
            a[p] = 0
            if t <= s:
                ans = 10 ** (i + 1) - int(n[p:])
                # print(10 ** (i + 1), int(n[p:]), ans)
                break
    print(ans)