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:
for _ in range(int(input())):
    n, s = map(str, input().split())

    s = int(s)
    n = list(n)
    q = 0
    for i in range(len(n)):
        q += int(n[i])
    if q <= s:
        print(0)
    else:

        if int(n[0]) < s:
            a = [n[0]]
            r = int(n[0])
            m = 0
            for i in range(1, len(n)):
                r += int(n[i])
                if r <= s-1:
                    a.append(n[i])
                else:
                    a[-1] = str(int(a[-1]) + 1)
                    m=i
                    break
            for i in range(len(a)-1,0,-1):
                if len(a[i])==2:
                    a[i-1]=str(int(a[i-1])+1)
                    a[i]='0'
                else:
                    break
            for i in range(m, len(n)):
                a.append('0')
            b = ''.join(a)
            c = ''.join(n)

            print(int(b) - int(c))
        else:
            a = ['1']
            for i in range(len(n)):
                a.append('0')
            b = ''.join(a)
            c = ''.join(n)

            print(int(b) - int(c))