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:
def digits(n):
  r = []
  while n > 0:
    r .append(  n % 10 )
    n = n // 10
  return r

def sumArray(d):
  r = 0
  for i in range( len(d) ):
    r += d[i]
  return r


T = int ( input() )
for t in range(T):
  st = input().split()
  n = int( st[0] )
  s = int( st[1] )
  d = digits(n) 
  i = 0
  m = 1
  op = 0
  sA = sumArray(d)
  #print(d)
  while sA > s:
    #print(d)
    if d[i] == 10:
      d[i] = 0
      sA -= 10
      if i+1 < len(d):
        d[i +1] += 1
      else:
        d.append(1)
      sA += 1
    elif d[i] > 0 :
      d[i] += 1
      sA += 1
      op += 1*m

    else:
      i += 1
      m *= 10
  print(op)