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:
# from bisect import bisect_left
TC = int(input())

for tc in range(TC):

    N, S = map(int, input().split())
    # print(N, S)
    digits = []
    x = N
    while x > 0:
        digits.append(x % 10)
        x //= 10

    digits.append(0)

    C = sum(digits)

    if C <= S:
        print(0)
        continue

    result = 0

    for i in range(len(digits)-1):
        d = digits[i]
        if d == 0:
            continue
        C -= d - 1
        result += (10 - d) * 10 ** i
        digits[i + 1] += 1
        # print(digits)
        if C <= S:
            break

    print(result)