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:
number = int(input())
data = list(map(int, input().split()))

for index in range(1, number, 1):
    current = list(map(int, input().split()))
    data.append(current[0])
    data.append(current[1])


def devide(number):
    array = []
    while number > 0:
        array.append(number%10)
        number = (number - (number % 10 )) // 10
    return array

def massiv(array):
    sum = 0
    for pos, element in enumerate(array):
        sum += 10**(len(array) - pos - 1) * element
    return sum

def partial(array):
    num = massiv(array)
    num = 10**len(array) - num
    return num

def check(array):
    sum = 0
    for pos, element in enumerate(array):
        sum += element
    return sum


def func(number1, number2):
    if number1 == number2:
        print(0)
    else:
        array = devide(number1)
        array.reverse()
        if(check(array) > number2):
            counter = 0
            value = 0
            for pos, element in enumerate(array):
                if element < number2:
                    number2 -= element
                elif counter == 0 and pos != 0:
                    counter = 1
                    array[pos - 1] = array[pos - 1] + 1
                elif pos == 0 and element >= number2:
                    value = 1
                    answer = partial(array)
                if counter == 1:
                    array[pos] = 0
            if value == 0:
                answer = massiv(array)
                print(answer - number1)
            else:
                print(answer)
        else:
            print(0)
                        

for element in range(0, len(data), 2):
    func(data[element], data[element+1])