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:
t=int(input())
powers_of_ten=[10**i for i in range(163)]
for i in range(t):
    string=input()
    n,s=string.split()[0],int(string.split()[1])
    n_int=int(n)
    start=n_int
    index=len(n)-1
    while True:
        sum=0
        for j in n:
            '''Считаем сумму цифр на каждой итерации'''
            sum+=int(j)
        if sum<=s:
            '''Возвращаем количество операций n->n+1'''
            print(n_int-start)
            break
        while n[index]==str(0):
            '''Переводим индекс на последний ненулевой элемент в числе'''
            index-=1
        rest=10-int(n[index])
        '''Получаем следующего возможного кандидата'''
        n_int+=rest*powers_of_ten[len(n)-1-index]
        n=str(n_int)