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:
from sys import stdin, gettrace

if gettrace():
    inputi = input
else:
    def input():
        return next(stdin)[:-1]


    def inputi():
        return stdin.buffer.readline()


def solve():
    n, s = input().split()
    s = int(s)
    nn = [0] + list(map(int, n))
    if sum(nn) < s:
        print(0)
        return
    mult = 1
    res = 0
    for i in range(len(nn)-1, 0, -1):
        if sum(nn) <= s:
            break
        v = nn[i]
        if v != 0:
            res += (10 - v) * mult
            nn[i] = 0
            nn[i-1] += 1
        mult *= 10
    print(res)




def main():
    t = int(input())
    for _ in range(t):
        solve()


if __name__ == "__main__":
    main()