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, math, heapq, collections, itertools, bisect
sys.setrecursionlimit(101000)

def solve(n, s):
    nn, n, s = int(n), list(map(int, n)), int(s)
    steps = 0
    while True:
        cs = 0
        i = 0
        while i < len(n):
            if cs + n[i] <= s:
                cs += n[i]
            else:
                break
            i += 1
        if i == len(n):
            break
        for j in range(i, len(n)):
            n[j] = 0
        carry = 1
        for j in range(i-1, -1, -1):
            n[j] += carry
            if n[j] == 10:
                n[j] = 0
                carry = 1
            else:
                carry = 0
        if carry == 1:
            n = [1] + n
        # steps += 1
        # if steps > 4:
        #     break
        # print(n)
    return int(''.join(map(str, n))) - nn

# 220000000000000
# 217871987498122


t = int(input())
for _ in range(t):
    # n = int(input())
    n, s = input().split()
    # a = list(map(int, input().split()))
    print(solve(n, s))