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 bisect
import copy
import fractions
import functools
import heapq
import math
import random
import sys


if __name__ == '__main__':

    T = int(input())

    for t in range(T):
        N, S = tuple(map(int, input().split()))

        if sum(int(dig) for dig in str(N)) <= S:
            print('0')
            continue

        # So we start counting digits from left to right
        # The first digits where the sum is greater than or equal to S and every digit following
        # needs to be set to 0, and the last digit we safely counted gets incremented
        # Our answer is the difference between this number and N

        str_N = '0' + str(N)

        total = 0
        i = 0
        while total < S:
            total += int(str_N[i])
            i += 1

        target = (int(str_N[:i-1]) + 1) * (10 ** (len(str_N) - i + 1))
        print(str(target - N))