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:
# Author: S Mahesh Raju
# Username: maheshraju2020
# Date: 04/09/2020
from sys import stdin, stdout, setrecursionlimit
import heapq
from math import gcd, ceil, sqrt
from collections import Counter, deque
from bisect import bisect_left, bisect_right
ii1 = lambda: int(stdin.readline().strip())
is1 = lambda: stdin.readline().strip()
iia = lambda: list(map(int, stdin.readline().strip().split()))
isa = lambda: stdin.readline().strip().split()
setrecursionlimit(100000)
mod = 1000000007

def get(n):
    tot = 0
    for i in n:
        tot += int(i)
    return tot

def inc(n):
    n = list(str(n))[::-1]
    ext = 1
    for i in range(len(n)):
        if int(n[i]) + ext > 9:
            n[i] = '0'
        else:
            n[i] = str(int(n[i]) + ext)
            ext = 0
    if ext:
        n += ['1']
    return int("".join(n)[::-1])
        
tc = ii1()
for _ in range(tc):
    n, s = iia()
    t = n
    tot = get(str(n))
    count = 0
    while tot > s:
        cur = n % 10
        t1 = get(str(n // 10))
        t2 = get(str(n))
        n //= 10
        n = inc(n)
        count += 1
        tot = get(str(n))
    n = n * (pow(10, count))
    print(n - t)