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:
def digits_sum(num):
    s = 0
    while num != 0 :
        s = s + (num%10)
        num = num // 10

    return s


a = int(input())
i = 0

while (i < a):

    inputs =  input().split(" ")
    num = int(inputs[0])
    num2 = int(inputs[1])

    temp = num
    iterator = 0
    
    while iterator < 19:
        temp2 = ((10** iterator) -(num % ( 10 ** iterator))) % (10 ** iterator)
        num = num + temp2

        if digits_sum(num) <= num2:
            print(num - temp)
            break
        
        iterator = iterator + 1
    i = i + 1