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 checkSum(n, s):
    j = 0
    k = len(n)
    r = int(n)
    sum = 0
    while r > 0:
        sum += (r % 10)
        r = r // 10
    if sum <= s:
        return 0
    else:
        m = 0
        sum = 0
        while sum < s:
            sum += int(n[j])
            j += 1
        if j - 1 == 0:
            m = ((m * 10) + 1)
            # print(m)
            for i in range(k):
                m = ((m * 10) + 0)
            # print(m)
            # print("".join(str(m)))
        else:
            for i in range(j - 2):
                m = ((m * 10) + int(n[i]))
            m = ((m * 10) + (int(n[j - 2]) + 1))
            for i in range(k - j + 1):
                m = ((m * 10) + 0)
        return m - int(n)
        # return 0

q = []
t = int(input())
for _ in range(t):
    l = list(input().split())
    s = int(l[1])
    n = l[0]
    q.append(checkSum(n, s))
for i in q:
    print(i)