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 get_sum(n):
    s = 0
    while(n):
        s += n%10
        n = n//10
    return int(s)

def get_results():
    n, s = list(map(int, input().split()))
    
    presum = get_sum(n)
    if presum<=s:
        return 0
    
    mul = 1
    moves = 0 
    while(presum>s):
        d = (n//mul)%10
        if(d!=0):
            dif = (10-d)*mul
            n += dif
            moves += dif
        presum = get_sum(n)
        mul = mul*10
    return moves

def main():
    t = int(input())
    res = []
    for i in range(t):
        res.append(get_results())

    for i in res :
        print(i)

if __name__=='__main__':
    main()