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:
def carryAdd(arr,start):
    carry = 1
    n = len(arr)
    for i in range(start,n):
        if(arr[i] < 9):
            arr[i] += 1
            carry = 0
            break
        else:
            arr[i] = 0
    if(carry == 1):
        arr.append(1)
    return arr

t = int(input())

for _ in range(t):
    x = input().split()
    n = x[0][::-1]
    arr = []
    sum1 = 0
    for i in range(len(n)):
        arr.append(int(n[i]))
        sum1 += arr[-1]
    s = int(x[1])
    n = len(arr)
    if(sum1 <= s):
        print(0)
    else:
        for i in range(len(arr)-1):
            if(arr[i] == 0):
                continue
            arr[i] = 0
            if(arr[i+1] < 9):
                arr[i+1] += 1
            else:
                arr = carryAdd(arr,i+1)
            sum1 = sum(arr)
            if(sum1 <= s):
                break
        sum1 = sum(arr)
        if(sum1 > s):
            arr[-1] = 0
            arr.append(1)
        ans = ""
        for i in range(len(arr)-1,-1,-1):
            ans += str(arr[i])
        ans = int(ans)
        print(ans-int(x[0]))