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 i in range(t):
    n,s = map(int,input().split())
    j = 0
    n = str(n)
    k = 0
    while j < len(n) and k + int(n[j]) <= s:
        k += int(n[j])
        j += 1
    if j == len(n):
        print(0)
    elif j == 0:
        print(int('1' + '0' * len(n)) - int(n))
    else:
        h = str((int(n[:j]) + 1) * 10 ** (len(n) - j))
        l = True
        while l:   
            j = 0
            k = 0
            while j < len(h) and k + int(h[j]) <= s:
                k += int(h[j])
                j += 1   
            if j == 0:
                h = '1' + '0' * len(n)
                l = False
            elif j != len(h):
                h = str((int(h[:j]) + 1) * 10 ** (len(h) - j)) 
            else:
                l = False
        print(int(h) - int(n))