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 _ in range(int(input())):
    n,s = map(int,input().split())
    digits = []
    while n > 0:
        digits.append(n%10)
        n //= 10

    result = 0
    cur_sum = 0
    cur = len(digits)-1
    while cur >= 0 and cur_sum <= s:
        cur_sum += digits[cur]
        cur -= 1

    cur += 1
    while cur_sum > s:
        # print(f"{digits} {cur} {cur_sum}")

        cur_sum -= digits[cur]
        cur_sum += 1

        n_sum = 0
        for (i,x) in enumerate(digits[0:cur+1]):
            n_sum += x*10**i
            digits[i] = 0

        result += 10**(cur+1) - n_sum
        cur += 1

        if cur >= len(digits):
            digits.append(1)
        elif digits[cur] != 9:
            digits[cur]+=1
        else:
            while digits[cur] == 9:
                digits[cur] = 0
                cur_sum -= 9
                cur += 1
                if cur >= len(digits):
                    digits.append(1)


    print(result)