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
import math
def II():
	return int(sys.stdin.readline())

def LI():
	return list(map(int, sys.stdin.readline().split()))

def MI():
	return map(int, sys.stdin.readline().split())

def SI():
	return sys.stdin.readline().strip()
def findSum(n,s):
	su = 0
	ind = -1
	for i in range(len(n)):
		su+=int(n[i])
		if su>s:
			ind = i
			break
	return ind
t = II()
for q in range(t):
	n,s = MI()
	n = str(n)
	ans = 0
	ind = findSum(n,s)
	while ind!=-1:
		f = n[:ind]
		if f == "":
			f = "0"
		se = "0"+"0"*(len(n)-ind-1)
		f = str(int(f)+1)+se
		ans+=int(f)-int(n)
		n = f
		ind = findSum(n,s)
	print(ans)