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 io
import os

from collections import Counter, defaultdict, deque


def solve(N, S):
    digitStr = str(N)
    digits = [int(x) for x in digitStr]
    if sum(digits) <= S:
        return 0
    best = float("inf")
    for i, d in enumerate(digits):
        temp = str(int(digitStr[:i] or 0) + 1) + "0" * (len(digits) - i)
        # print('temp', temp)
        if sum(map(int, temp)) <= S:
            best = min(best, int(temp) - N)

    return best


if __name__ == "__main__":
    input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline

    TC = int(input())
    for tc in range(1, TC + 1):
        N, S = [int(x) for x in input().split()]
        ans = solve(N, S)
        print(ans)