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 solve(n,s,ans):
    total = 0
    n = list(str(n))
    for i in range(len(n)):
        n[i] = int(n[i])
        total += n[i]

    if total <= s:
        ans.append('0')
        return

    moves = 0
    index = 0
    while n and total > s:
        last = n.pop()
        total -= last
        moves += (10-last)*pow(10,index)
        index += 1

        total += 1
        if n:
            i2 = len(n)-1
            while i2 >= 0:
                if n[i2] == 9:
                    total -= 9
                    n[i2] = 0
                    i2 -= 1
                else:
                    n[i2] += 1
                    break
                
            if i2 == -1:
                n.insert(0,1)
        else:
            n.append(1)

        #print(n,total)
        

    #print(moves)
    ans.append(str(moves))

def main():
    t = int(input())
    ans = []
    for i in range(t):
        n,s = map(int,input().split())
        solve(n,s,ans)

    print('\n'.join(ans))
    

main()