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 = sys.stdin.buffer.readline
def print(val):
    sys.stdout.write(str(val) + '\n')
def prog():
    for _ in range(int(input())):
        n,s = map(int,input().split())
        n = str(n)[::-1]
        
        prefix = [0]
        for i in range(len(n)):
            prefix.append(prefix[-1] + int(n[i]))
            
        if prefix[len(n)] <= s:
            print(0)
            continue

        finished = False
        for i in range(len(n)):
            if (n[i] == '9'):
                continue
            best = 1 + prefix[len(n)] - prefix[i]
            if best <= s:
                added_to = n[:i][::-1]
                print(10**(len(added_to)) - int(added_to))
                finished = True
                break
        
        if not finished:
            print(10**(len(n)) - int(n[::-1]))
prog()