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:
for _ in range(int(input())):
   n, s = map(int, input().split())
   string_n = str(n)
   string_s = str(s)
   size_n = len(string_n)
   size_s = len(string_n)
   m = size_n - size_s
   mov = 0
   for i in string_n:
      mov+=int(i)
   if s>=n or mov<=s: print(0)
   else:
      f = string_n[0]
      fs = string_s[0]
      f_plus_1 = str(int(f)+1)
      x, y = 1, int(string_n[0])
      while y<s:
         y+=int(string_n[x])
         x+=1
      if x==1 and int(f) >= s: ans = int('1'+'0'*size_n) - n
      else: ans = int(str(int(string_n[:x-1])+1)+'0'*(size_n-x+1)) - n
      print(ans)