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 = input()
t = int(t)

def solve(n, s):

    def digit_sum(n):
        rev_n = str(n)
        a = 0
        for x in rev_n:
            a+=int(x)
        return a

    current_sum = digit_sum(str(n))

    if current_sum<=s:
        print(0)
        return

    rev_n = str(n)[::-1]

    limit = len(rev_n)

    for i in range(limit):

        tmp_current_sum = current_sum
        if rev_n[i]!='0':
            ans = 10**(i+1) - n%(10**(i+1))
            tmp_current_sum -= digit_sum(n%(10**(i+1)))

            if i+1<limit and rev_n[i+1]=='9':
                tmp_current_sum-=9
            tmp_current_sum+=1
            if tmp_current_sum<=s :
                current_sum = tmp_current_sum
                break

    if current_sum>s :
        ans = 10**limit - n%(10**(limit))

    print(ans)

for i in range(t):
    n, s = map(int, input().split())
    solve(n, s)