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
input = sys.stdin.readline

'''

'''
tot = 0
ops = 0

def safe_add(digits, i):
    global tot, ops
    if not(i < len(digits)):
        digits.append(i)
        tot += 1
    elif digits[i] == 9:
        digits[i] = 0
        tot -= 9
        safe_add(digits, i+1)
    else:
        digits[i] += 1
        tot += 1

def nullify(digits, i):
    global tot, ops
    if digits[i] == 0:
        return
    
    ops += (10-digits[i]) * 10**i
    tot -= digits[i]
    digits[i] = 0
    safe_add(digits, i+1)
    return

def solve(digits, s):
    global tot, ops
    if tot <= s:
        return

    i = 0
    while tot > s:
        nullify(digits, i)
        i += 1
    
    return

t = int(input())
for _ in range(t):
    n, s = input().rstrip().split()
    digits = [int(d) for d in n[::-1]]
    tot = sum(digits)
    ops = 0
    solve(digits, int(s))
    print(ops)