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(int,stdin.readline().strip().split())
	f = 1
	w = q = z=x
	sum =0 
	while w!= 0:
		sum+= (w%10)
		w//=10
		
	i = 0 
	if sum <=  y :
		print(0)
	else:
		while True:
			if sum+1 <= y :
				if f != 1:
					q = q*f+f

				break
			else: 
				
				f*=10
				sum-=(q%10)
				q//=10 
		print(q-x)