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:
# https://codeforces.com/contest/1409/problem/D



def sum_of_digits(number):
    total_sum = 0
    while number > 0:
        total_sum += (number % 10)
        number = number // 10    
    return total_sum


t = int(input())

for i in range(t):
    n, s = map(int, input().split())
    total_sum = sum_of_digits(n)
    ans = 0
    if total_sum <= s:
        print(ans)
    else:
        pw = 1
        for i in range(18):
            last_digit = (n // pw) % 10
            add_digit = pw * ((10 - last_digit) % 10)
            pw *= 10
            n += add_digit
            ans += add_digit
            if sum_of_digits(n) <= s:
                print(ans)
                break