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 moves(n,s):
    d=10
    P=0
    k=n
    j=1
    if S(n)<=s:
        P+=0
    else:
          while(S(n))>s:
            dig=k%10
            C=((10-dig))*j
            P+=C
            n+=C
            k=n
            k//=d
            j*=10
            d*=10
    print(P)    
            
def S(n):
  J=0
  while(n!=0):
      J+=n%10
      n//=10
      
  return J
for _ in range(int(input())):
   n,s=(map(int,input().split()))
   moves(n,s)