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 i in range(int(input())):
    n, s = map(int, input().split())
    l1 = list(str(n))
    sum = 0
    j = 0
    final = []
    if n == s:
        print(0)
        continue
    current_sum = 0
    for k in range(len(l1)):
        current_sum = current_sum + int(l1[k])
    if current_sum <= s:
        print(0)
        continue
    while sum < s:
        sum = sum + int(l1[j])
        if sum >= s:
            final = l1[j:len(l1)]
        j += 1
    a = '1' + '0' * len(final)
    a = int(a)
    final = "".join(final)
    print(a - int(final))