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 fileinput

T = input()
T = int(T)
for case in range(0,T):
    n,s = map(int, input().split())
    initTot =0
    for num in str(n):
        initTot += int(num)

    curSeen =0
    if n != s and initTot > s:
        for i,digit in enumerate(str(n)[::-1]):
            if initTot+1 - (int(digit)+curSeen) <= s:
                res = 10**(i+1) - int(str(n)[-i-1:])
                print(res)
                break
            curSeen += int(digit)
    else:
        print(0)



        




# [0011?1?010]