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

if __name__ == '__main__':

    n = 0
    n = int(input())
    index  = 0
    while index<n:
        a = 0
        b = 0
        a,b = (input().split(' '))
        a = int(a)
        b = int(b)
        index+=1
        if a<=b:
            print(0)
            continue

        l_a = list(str(a))

        tmp_sum = 0
        for val in l_a:
            tmp_sum+=int(val)

        if tmp_sum <= b:
            print(0)
            continue
        #print(l_a)
        start =0
        sum = 0
        if int(l_a[0]) < int(b):

            while start<len(l_a) and sum+int(l_a[start])<int(b):
                sum+=int(l_a[start])
                start+=1
            #print(start)
            #print(sum)
            if sum>int(b):
                start-=1
                sum-=int(l_a[start])


        #print("rest : ",l_a[start:])
        #print(int("".join(l_a[start:])))


        x = int(math.pow(10,len(l_a[start:])))

        if len(l_a[start:])==0:
            print(0)
            continue
        y = int("".join(l_a[start:]))

        print(x - y)