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:
from sys import stdin
N = int(stdin.readline())
for case in range(N):
    num, maxsum = map(int, stdin.readline().split())
    power = 0
    sol = 0
    ds = 0
    idx = 0
    for i in str(num):
        ds += int(i)
    for count in range(18):
        if ds <= maxsum:
            break
        digit = int(str(num)[-1 - power])
        if digit == 0:
            power += 1
            continue
        ds -= digit
        sol += 10**power * ((10-digit)% 10)
        num += 10**power * ((10-digit)% 10)
        power += 1
        while(int(str(num)[-1 - power]) == 0):
            power += 1
            ds -= 9
        ds += 1
    print(sol)