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
# input = lambda: sys.stdin.readline().rstrip()
import sys
import math
input = sys.stdin.readline
from collections import deque
from queue import LifoQueue
for _ in range(int(input())):
  n,s = input().split()
  s = int(s)
  su = 0
  sco = []
  sco1 = []
  for i in n:
    su+=int(i)

  if su<=s:
    print(0)

  else:
    a = 0
    for i in range(len(n)):
      sco.append((10-int(n[-i-1]))*(10**(i)))
      
      sco1.append(10**(i+1)-int(n[-i-1:]))\

    for i in range(len(sco)):
      pp = str(int(n)+sco[i])
      pps = str(int(n)+sco1[i])
      suma = 0
      for j in pp:
        suma+=int(j)
      cum = 0
      for j in pps:
        cum+=int(j)
      if min(suma,cum)<=s:
        if suma<=cum:
          print(sco[i])
          break
        else:
          print(sco1[i])
          break