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 getDigit(n, i):
    if i > 1:
        return getDigit(n // 10, i - 1)
    else:
        return n % 10

t = int(input())



while t:
    t -= 1
    line = input().split()
    n = int(line[0])
    s = int(line[1])

    ans = 0

    ns = str(n)
    tot = 0
    for char in ns:
        tot += int(char)
    
    if(tot <= s):
        print(0)
        continue

    for i in range(1, 21):
        dig = getDigit(n, i)

        toAdd = pow(10, i - 1) * (10 -dig)
        if(dig == 0):
            toAdd = 0

        ans += toAdd

        if(dig > 0):
            n += toAdd
    
        ns = str(n)
        tot = 0
        for char in ns:
            tot += int(char)
        
        if(tot <= s):
            break

    print(ans)