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:
t = int(input())
for _ in range(t):
    n, s = map(int, input().split())
    m = str(n)
    t = 0
    for i in range(len(m)):
        t += int(m[i])
    if t <= s:
        print(0)
    else:
        temp = 0
        m = list(m)
        m.reverse()
        m = [int(d) for d in m]
        m.append(0)
        m.append(0)
        cnt = 0
        for i in range(len(m)):
            #if m[i] == 0:
                #continue
            cnt += (10-m[i])*10**i
            if i != len(m)-1:
                temp += m[i]-1
                m[i+1] += 1
            else:
                temp += m[i]-1
            if temp >= (t-s):
                print(cnt)
                break
        else:
            ans = 10**len(m)-n
            print(ans)