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 math
import sys
from sys import stdin, stdout
sys.setrecursionlimit(100000)

MOD = 10**9 + 7

int_input = lambda: int(stdin.readline())
list_input = lambda: list(map(int, stdin.readline().split()))

sum_of_digit = lambda n: sum(map(int, list(str(n))))


def factors(n):
    fact = [1, n]
    for i in range(2, int(sqrt(n))+1):
        if n % i == 0:
            fact.append(i)
            if n // i != i:
                fact.append(n // i)
        
    return fact
    
    

def sieve(n):
    primes = [True] * (n + 1)
    primes[0], primes[1] = False, False
    for i in range(2, int(math.sqrt(n)) + 1):
        if primes[i]:
            for j in range(i * i, n + 1, i):
                primes[j] = False
                
    return primes
    
    
for _ in range(int_input()):
    a, b = list_input()
    
    x = sum_of_digit(a)
    if x <= b:
        print(0)
        continue
        
    s = str(a)
    ind, val = 0, 0
    ans = ""
    while ind < len(s) and val + int(s[ind]) < b:
        ans += s[ind]
        val += int(s[ind])
        ind += 1
        
    if ans:
        ans = str(int(ans) + 1)
    else:
        ans = "1"
    ans += "0" * (len(s) - ind)
    
    # print(ans)
    print(int(ans) - a)