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:
# @uthor : Kaleab Asfaw
from sys import stdin, stdout
# Fast IO
def input():
	a = stdin.readline()
	if a[-1] == "\n": a = a[:-1]
	return a
def print(*argv, end="\n", sep=" "):
	n = len(argv)
	for i in range(n):
		if i == n-1: stdout.write(str(argv[i]))
		else: stdout.write(str(argv[i]) + sep)
	stdout.write(end)
# Others
mod = 10**9+7
def lcm(x, y):
	from math import gcd
	return (x * y) / (gcd(x, y))
def comb(lst, x):
	from itertools import combination as c
	return list(comb(lst, x))
def fact(x, mod=mod):
	ans = 1
	for i in range(1, x+1): ans = (ans * i) % mod
	return ans
def arr2D(n, m, default=0):
	lst = []
	for i in range(n): temp = [default] * m; lst.append(temp)
	return lst
def sortDictV(x):
	return {k: v for k, v in sorted(x.items(), key = lambda item : item[1])}
# Remember to Add BS

def solve(n, x):
	n = str(n)[::-1]
	summ = 0
	for i in n:
		summ += int(i)
	if summ <= x:
		return 0 
	else:
		summ1 = 0
		for i in range(len(n)):
			summ1 += int(n[i])
			if summ - summ1 + 1<= x:
				# print(i, summ1, int(n[::-1][:len(n)-i] + ("9"*(i+1))))
				return int(n[::-1][:len(n)-i-1] + ("9"*(i+1))) + 1 - int(n[::-1])
	return "NO"


for _ in range(int(input())): # Multicase
	n, x = list(map(int, input().split()))
	print(solve(n, x))