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 sys import stdin, stdout
input = stdin.buffer.readline

def rec(a, i, c):
	res = 10 ** 20
	if c < 0:
		return res
	if i >= len(a):
		return int(a)
	if a[i] != '9' and c - int(a[i]) - 1 >= 0:
		res = int(a[:i] + str(int(a[i]) + 1) + '0' * len(a[i + 1:]))
		#print(a[:i] + str(int(a[i]) + 1) + '0' * len(a[i + 1:]))
	return min(res, rec(a, i + 1, c - int(a[i])))
	

for _ in range(int(input())):
	n, s = map(int, input().split())
	x = rec(str(n), 0, s)
	#print(x)
	if x == 10 ** 20:
		print(10 ** len(str(n)) - n)
	else:
		print(x - n)