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:
import sys
read = lambda: sys.stdin.readline().strip()


for _ in range(int(read())):
    s, n = read().split()
    n = int(n)
    s = list(map(int, list(s)))[::-1]
    s1 = s.copy()
    total = sum(s)
    if total <= n:
        print(0)
        continue
    place = None
    temp_sum = 0
    for i, digit in enumerate(s):
        s1[i] = 0
        temp_sum += digit
        if (total - temp_sum + 1) <= n:
            break
    
    i += 1
    while i < len(s1):
        s1[i] += 1
        if s1[i] > 9:
            s1[i] = 0
            i += 1
        else:
            break
    else:
        s1.append(1)
        
    
    s1 = int("".join(map(str, s1[::-1])))
    s = int("".join(map(str, s[::-1])))
    # print("dbg", s1)
    print(s1 - s)