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:
for t in range(int(input())):
    n,s = map(int, input().split())
    num = list(str(n))
    if sum(map(int, num)) <= s:
        print('0')
        continue
    final_ans = list('1' + '0'*len(num))
    res, idx = 0, len(num)-1
    while num != final_ans:
        num[idx] = '0'
        idx -= 1
        while idx >= 0 and num[idx] == '9':
            num[idx] = '0'
            idx -= 1
        if idx < 0:
            res += int(''.join(final_ans)) - n
            break
        num[idx] = str(int(num[idx])+1)
        res += int(''.join(num)) - n
        n = int(''.join(num))
        if sum(map(int, num)) <= s:
            break
    print(res)