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 Check(n, m):
    Sum = 0
    for i in str(n):
        Sum += int(i)
    return Sum <= m


def Solve():
    n, m = map(int,input().split())
    x = n
    if Check(n, m):
        print(0)
        return
    else:

        n = str(n)
        Sum = 0
        for i in range(len(n)):
            Sum += int(n[i])
            if Sum >= m and i == 0:
                n = '1' + '0' * (len(n))
                print(int(n) - x)
                return
            if Sum >= m:
                if int(n[i - 1]) + 1<10:
                  n = n[0:i - 1] + str(int(n[i - 1]) + 1) + '0' * (len(n) - i)
                  print(int(n)-x)
                else:
                  while i>=1 and int(n[i-1])+1==10:
                    i-=1
                  if i==0:
                    n = '1' + '0' * (len(n))
                    print(int(n) - x)
                  else:
                    n = n[0:i - 1] + str(int(n[i - 1]) + 1) + '0' * (len(n) - i)
                    print(int(n)-x)
                return


t = int(input())
for _ in range(t):
    Solve()