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 sum_digits(stri):
    out = 0
    for i in range(len(stri)):
        out+=int(stri[i])
    return out
def findLastNonZero(n):
    for i in range(len(n)):
        if n[len(n) - i - 1] != '0':
            return len(n) - i - 1
lol = int(input())
for i in range(lol):
    nums = input().split()
    n = nums[0]
    s = int(nums[1])
    moves = 0
    # j = 0
    while(sum_digits(n) > s):
        curr_pos = findLastNonZero(n)
        # print(curr_pos)
        curr_digit = len(n) - curr_pos - 1
        curr_num = int(n[curr_pos])
        n = int(n)
        temp = (10 - curr_num) * 10**curr_digit
        n+=temp
        n = str(n)
        moves+=temp
        # print(n)
    print(moves)