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:
# D. Decrease the Sum of Digits
# time limit per test
# 2 seconds
# memory limit per test
# 256 megabytes
# input
# standard input
# output
# standard output

# 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⋅104) — 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≤1018; 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.

def sum(s):
	ans = 0
	while s>0:
		ans+=s%10
		s//=10
	return ans
def fun(n,target):
	n,target = int(n),int(target)
	ans= 0 
	# while n>0:
	# 	digit = n%10
	# 	add = ans*10 + (10-digit)%10
	# 	ans = add
	# 	n+=add
	# 	n//=10
	# 	if sum(n) <= target:
	# 		return ans
	# return ans
		
	if sum(n)<=target:
		return 0
	power = 1
	while sum(n)>target:
		digit = (n//power)%10
		# print(digit,"--"/)
		add  = power*(10-digit)
		ans+=add
		n+=add
		power*=10
	return ans




for _ in  range(int(input())):
	
	start,target = input().split()
	print(fun(start,target))