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 sys
from collections import defaultdict as dd
from collections import Counter as cc
from queue import Queue
import math
import itertools
try:
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
except:
	pass
input = lambda: sys.stdin.buffer.readline().rstrip()


for _ in range(int(input())):
	n,s=map(int,input().split())
	k=[]
	while n>=10:
		k.append(n%10)
		n//=10
	k.append(n)
	k+=[0,0,0]
	l=[0]*len(k)
	q=sum(k)
	if q<=s:
		print(0)
	else:
		i=0
		while q>s and i<len(k):
			if k[i]<1:
				i+=1
				continue
			l[i]+=10-k[i]
			k[i+1]+=1
			k[i]=0
			if k[i+1]>9:
				k[i+1]-=10
				k[i+2]+=1
			q=sum(k)
			i+=1
		r=0
		for i in range(len(l)):
			r+=l[i]*(10**i)
		print(r)