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())

for x in range(t):

    s=input()
    s1=s.split()

    sum1=int(s1[1])
    sum2=0
    s=s1[0]
    flag=0

    def fun(s):

        sum2=0
        for i in range(len(s)):

            sum2=sum2+int(s[i])

        if sum2<=sum1:

            return(0)
        else:
            return(-1)

    if fun(s)==0:

        print(0)
        
    else:

        for i in range(len(s)-1,-1,-1):

            rem=int(''.join(['1']+['0']*(len(s)-i)))-int(s[i:])

            if fun(str(rem+int(s)))==0:

                print(rem)
                break