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:
import sys, collections

tc = int(sys.stdin.readline())
for _ in range(tc):
    n, s = map(int, sys.stdin.readline().split())
    ans = []
    self = 0
    for i in range(len(str(n))):
        self += int(str(n)[i])
    if self <= s:
        ans.append(n)

    ans.append(int('1' + '0' * len(str(n))))
    for i in range(len(str(n))):
        if i == 0:
            temp = str(int(str(n)[i]) + 1) + '0' * (len(str(n)) - 1)
            cnt = 0
            for i in temp:
                cnt += int(i)
            if cnt <= s:
                ans.append(int(temp))
        else:
            temp = int(str(n)[:i+1])
            temp += 1
            temp = str(temp)
            for j in range(i + 1, len(str(n))):
                temp += '0'
            cnt = 0
            for i in temp:
                cnt += int(i)
            if cnt <= s:
                ans.append(int(temp))
    res = []
    for i in ans:
        res.append(i - n)
    res.sort()
    print(res[0])