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 getSumOfDigits(num: int) -> int:
    ans = 0
    while num:
        digit = num % 10
        num //= 10
        ans += digit
    return ans

def decreaseTheSumOfDigits(n: int, s: int) -> int:
    ans = 0
    i = 1
    while (getSumOfDigits(n) > s):
        summand = 10**i - (n % 10**i)
        n += summand
        ans += summand
        i += 1
    return ans

# def decreaseTheSumOfDigits(n: int, s: int) -> int:
#     ans = 0
#     i = len(str(n)) - 1
#     while (getSumOfDigits(n) > s):
#         old_str = str(n)
#         if (old_str[i] != "0"):
#             summand = (10 - int(old_str[i]))*10**(len(old_str) - 1 - i)
#             n += summand
#             ans += summand
#         i -= 1
#     return ans

test_cases = int(input())

for _ in range(test_cases):
    inputs = list(map(int, input().split(" ")))
    print(decreaseTheSumOfDigits(inputs[0], inputs[1]))