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 t in range(int(input())):
    t1 = input().split(' ')
    n = '0' + t1[0]
    s = int(t1[1])

    sum = 0
    f = 0
    a = []

    for i in range(len(n)):
        sum+=int(n[i])
        a.append(int(n[i]))
        if sum > s:
            f=i
            break

    if sum > s:
        for j in range(f,-1,-1):
            sum -= a[j]
            a[j] = 0
            a[j-1]+=1
            sum+=1
            if sum <= s:
                break
    else:
        print(0)
        continue

    i = 1
    sub = 0
    for j in range(f,-1,-1):
        sub += a[j]*i
        i*=10

    sub = sub * (10**((len(n)-f)-1))
    print(abs(sub - int(t1[0])))