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
import math
import collections
import bisect
import itertools
import decimal
import copy

# import numpy as np

# sys.setrecursionlimit(10 ** 6)
INF = 10 ** 20
# MOD = 10 ** 9 + 7
# MOD = 998244353

ni = lambda: int(sys.stdin.readline().rstrip())
ns = lambda: map(int, sys.stdin.readline().rstrip().split())
na = lambda: list(map(int, sys.stdin.readline().rstrip().split()))
na1 = lambda: list(map(lambda x: int(x) - 1, sys.stdin.readline().rstrip().split()))


# ===CODE===
def main():
    t = ni()
    for _ in range(t):
        n, s = ns()
        a = [int(i) for i in list(str(n))]
        total = sum(a)

        a.reverse()
        a.append(0)

        ar = a.copy()

        if total>s:
            ans = 0
            for i in range(len(ar)):
                if ar[i] == 10:
                    total -= a[i]
                    ar[i + 1] += 1
                    if total + 1 <= s:
                        total += 1
                        break
                elif ar[i] > 0:
                    total -= a[i]
                    ar[i + 1] += 1
                    ans += pow(10, i) * (10 - ar[i])
                    if total + 1 <= s:
                        total += 1
                        break

            print(ans)

        else:
            print(0)


if __name__ == '__main__':
    main()