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 math import *

t=int(input())

while t>0:
	a,s1=input().split()
	s=int(s1)
	val=0
	ans1=[]
	ind=-1
	tot=0
	for i in range(len(a)):
		tot=tot+int(a[i])
	if tot<=s:
		print(0)
		t-=1
		continue
	for i in range(len(a)):
		if val+int(a[i])>=s:
			ind=i
			break
		ans1.append(a[i])
		val=val+int(a[i])

	if ind==-1:
		print(0)
	elif ind==0:
		ans="10"
		for i in range(1,len(a)):
			ans=ans+"0"
		print(int(ans)-int(a))
	else:
		i=ind-1
		while i>0 and ans1[i]=='9':
			ans1[i]='0'
			i-=1
		ans1[i]=str(int(ans1[i])+1)
		for i in range(ind,len(a)):
			ans1.append('0')

		ans=""
		for i in ans1:
			ans=ans+i

		print(int(ans)-int(a))

	t-=1