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 math
from collections import deque
from sys import stdin, stdout
from string import ascii_letters
import sys
letters = ascii_letters
input = stdin.readline
#print = stdout.write

for i in range(int(input())):
#for i in range(1):
    bf = input().strip().split()
    s = int(bf[1])
    arr = list(map(int, bf[0]))
    before = 1
    while arr[-1] == 0:
        arr.pop(-1)
        before *= 10
    have = sum(arr)
    need = 0
    
    n = len(arr)
    for i in range(n - 1, -1, -1):
        if have <= s:
            break
        if arr[i] <= 0:
            before *= 10
            continue
        need += (10 - arr[i]) * before
        have -= arr[i]
        arr[i] = 0
        ind = i - 1
        while ind >= 0:
            arr[ind] += 1
            have += 1
            if arr[ind] == 10:
                arr[ind] = 0
                have -= 10
                if ind == 0:
                    break
            else:
                break
            ind -= 1
        before *= 10
    print(need)