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 math


def main():
    try:

        # accept input
        n = int(input())
        if (not(1 <= n <= 10**4)):
            exit(1)
        inputList = []
        for i in range(n):
            temp = list(map(int, input().split()))
            if (len(temp) != 2 or temp[0] < 1 or temp[1] > 10**9):
                exit(1)
            inputList.append(temp)

        # performing logic
        total = []
        for array in inputList:
            if (array[0] % array[1] == 0):
                total.append(0)
            else:
                total.append(math.ceil((array[0] / array[1])
                                       * 1.0) * array[1] - array[0])
                # reformatting result
        for item in total:
            print(item)

    except:
        exit(1)


if __name__ == "__main__":
    main()