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:
# from collections import defaultdict

import io, os, math
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline

rr = lambda: input()
rri = lambda: int(input())
rrm = lambda: list(map(int, input().split()))

INF=float('inf')

def sumd(m):
	sd = 0
	while m > 0:
		sd += m % 10
		m //= 10
	return sd

def solve(n,s):
	# n+=1
	# sum digits less than s
	amt=0
	sd = sumd(n)
	if sd <= s:
		return 0
	else:
		# next significant one
		construct = 0
		m = n
		leng = len(str(m))
		large = 10
		rightside = m % 10
		leftside = n // 10

		for ll in range(1, leng+1):
			#print(leftside, rightside, large)
			construct = large - rightside

			if sumd(construct+n) <= s:
				return construct

			rightside += (leftside % 10) * large
			large *= 10
			leftside //= 10

		#print(larger, 'larger')
		return construct


t = rri()
for _ in range(t):
	n,s=rrm()
	print(solve(n,s))