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:
# https://codeforces.com/contest/1328/problem/A

def solve(a, b):
	'''
	1 <= t <= 10^4
	1 <= a,b <= 10^9
	'''
	return (b - a % b) % b


if __name__ == '__main__':
	t = int(input())
	for _ in range(t):
		a, b = map(int, input().split())
		print(solve(a, b))


assert(solve(10, 4) == 2)
assert(solve(13, 9) == 5)
assert(solve(100, 13) == 4)
assert(solve(123, 456) == 333)
assert(solve(92, 46) == 0)