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

t = int(input())
for _ in range(t):
    n, s = map(int, input().split())
    sum = sod(n)
    if sum <= s:
        print(0)
        continue

    t = list(str(n))
    m = len(t)
    idx = -1
    cnt = 0
    for i in range(m):
        cnt += int(t[i])
        if cnt < s:
            idx = i
    
    while idx >= 0 and t[idx] == '9':
        idx -= 1

    if idx == -1:
        t = '0' * (m + 1)
        t = list(t)
        t[0] = '1'
    else:
        t[idx] = chr(ord(t[idx]) + 1)
        idx += 1
        for i in range(idx, m):
            t[i] = "0"
    
    x = str()
    for c in t:
        x = x + c

    print(int(x) - n)