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:
t=int(input())

bl=[]
for i in range(t):
  tempo=input()
  bl.append(tempo)
  
def sdigits(n):
  sum=0
  for i in n:
    sum+=int(i)
  return sum
  
for i in range(t):
  s1=bl[i]
  s1=s1.split();

  n=s1[0]
  s=int(s1[1])
  
  if sdigits(n)<=s:
    print(0)
  else:
    temp=0
    ix=0
    for i in range(len(n)):
      temp+=int(n[i])
      if temp>=s:
        ix=i     
        break
     
    if ix>0:
      fin=str(int(n[ :ix])+1)
    else:
      fin="1"
    rem=len(n)-ix
    fin+="0"*rem
    fin=int(fin)
    fin=fin-int(n)
  
    print(fin)