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:
#!/usr/bin/python3

if __name__ == "__main__":
	t = int(input())

	while t:
		user_input = list(map(int, input().split()))
		digits = []
		i = 0
		total = 0

		temp = user_input[0] 
		while( temp ):
			digits.append( temp%10 )
			temp //= 10
			total += digits[i]
			i += 1

		if( total <= user_input[1] ):
			print( 0 )
		else:
			value = 1
			while( i ):
				value *= 10
				i -= 1

			#print( value - user_input[0] )

			for i in range(0, len(digits)):
				total = total - digits[i] + 1
				#print( total )
				if( total <= user_input[1] ):
					if( i == len(digits)-1 ):
						number = total
						for j in range(0, len(digits)):
							number *= 10

						solution = number - user_input[0]
						print( solution )
						break

					j = len(digits) - 1
					number = digits[j]
					j -= 1

					while( j > i ):
						number = (number * 10) + digits[j]
						j -= 1

					number += 1
					for j in range(0, i+1):
						number = number * 10

					solution = number - user_input[0]
					print( solution )
					break

				total -= 1
		t -= 1