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 solution(line, n):
    crnt_sum = 0
    res = []
    for idx, item in enumerate(line):
        crnt_sum += item
        if crnt_sum < n:
            res.append(item)
        else:
            if crnt_sum == n and (idx == len(line) - 1 or sum(line[idx+1:]) == 0):
                res.append(item)
            else:
                res.extend([0]*(len(line) - idx))
                while True:
                    if idx == 0:
                        res[0] = 0
                        res = [1] + res
                        break
                    else:
                        if res[idx-1] != 9:
                            res[idx-1] += 1
                            break
                        else:
                            res[idx-1] = 0
                            idx -= 1
                return(''.join(tuple(map(str, res))))
    return(''.join(tuple(map(str, res))))


n = int(input())
for _ in range(n):
    line, n = input().split()
    z = int(line)
    line = tuple(map(int, list(line)))
    n = int(n)
    print(int(solution(line, n)) - z)