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:
#500 4
#49 5

#139 5

#find the closest number greater than that works

#the digit before the total hits the target?

def moves(n, k):
    total = 0
    for j in range(len(n)):
        total += int(n[j])
    if total <= k:
        return 0
    total = 0
    n = '0' + n
    i = 1
    while total + int(n[i]) < k:
        total += int(n[i])
        i += 1
    num = (int(n[:i]) + 1) * 10**(len(n) - i)
    return num - int(n)

T = int(input())
for t in range(T):
    n, k = input().split(' ')
    print(moves(n, int(k)))