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
from os import path
if(path.exists('input.txt')):
    stdin = open("input.txt","r")

for _ in range(int(stdin.readline())):
	x,y = map(str,stdin.readline().split())
	y = int(y)
	org = int(x)
	sum= 0
	for i in range(len(x)):
		sum+=int(x[i])
	if sum > y :
		for i in range(len(x)-1,-1,-1):
			if (sum-int(x[i])) < y :
				x = x[:i]+'0'+x[i+1:] 
				if i == 0 :
					x = '1'+x
				else:
					j = i-1
					while True:
						if x[j] =='9' and j > 0 :
							x = x[:j]+'0'+x[j+1:]
						elif j == 0  and x[j] == '9':
							x = x[:j]+'0'+x[j+1:]
							x = '1' +x
							break
						elif x[j] != '9':
							x = x[:j]+chr(ord(x[j])+1)+x[j+1:]
							break
						

						j-=1
				break
			sum-=int(x[i])
			x = x[:i]+'0'+x[i+1:]
	
	print(int(x)- org)