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

for _ in range(cf):
    sn, x = input().split()
    x = int(x)
    n = [0]*len(sn)
    s = 0
    for i in range(len(n)):
        n[i] = int(sn[i])
        s += n[i]
    if s <= x:
        print(0)
        continue
    ans = 0
    deg = -1

    for i in range(len(n)-1, -1, -1):
        deg += 1
        if n[i] == 0:
            continue
        ans += (10-n[i])*10**deg
        if i == 0:
            break
        n[i] = 0
        for j in range(i-1, -1, -1):
            if n[j] < 9:
                n[j] += 1
                break
            n[j] = 0
            if j == 0:
                n = [1]+n
                break
        s = 0
        for j in range(len(n)):
            s += n[j]

        #print(n)

        if s <= x:
            break

    print(ans)