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 sys

#sys.stdin = open("in.txt")
#sys.stdout = open("out.txt", "w")

def clean(ans):
    pos = 0
    for c in ans:
        if c == '0':
            pos += 1
        else:
            break
    if pos == len(ans):
        pos -= 1
    return ans[pos::]

def task():
    n, s_str = input().split()
    s = int(s_str)
    d = 0
    for c in n:
        d += int(c)

    pos = len(n) -1
    res = ""
    carry = 0
    while (d > s) or (carry != 0):
        sum = (int(n[pos]) if pos >= 0 else 0)

        d -= sum
        sum += carry
        dig = sum % 10
        d += dig
        carry = int(sum / 10)

        if (d <= s) and (carry ==0):
            break

        d -= dig
        diff = 10 - dig if dig != 0 else 0
        res = str(diff) + res
        sum += diff
        carry = int (sum / 10)

        pos -= 1
    if res == "":
        res = "0"
    return clean(res)


n = int(input())
for i in range(n):
    print(task())