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:
#-------------------------------------------------------------------------
import math
#----------------------------------------------------------------------------
def ii():return int(input())
def si():return input()
def li():return list(map(int,input().split()))
def mi():return map(int,input().split())
def dpc(a,b):return [[0]*b for i in range(a)]

def sum_digits(n):
   r = 0
   while n:
       r, n = r + n % 10, n // 10
   return r
#-----------------------------------------------------------------------------

def solve():
	n,s=mi()
	sm=sum_digits(n)
	move=0
	while(sm>s):
		temp=str(n)
		d=0
		cnt=-1
		# print(temp)
		for i in range(len(temp)-1,-1,-1):
			cnt+=1
			if(temp[i]!='0'):
				d=int(temp[i])
				break
			
		# print(d,cnt)
		move+=((10-d)*(10**cnt))
		n+=((10-d)*(10**cnt))
		sm=sum_digits(n)
	print(move)









	
















#-----------------------------------------------------------------------------

t=ii()
for _ in range(t):
	solve()
# solve()