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:
from sys import stdin
###############################################################
def iinput(): return int(stdin.readline())
def minput(): return map(int, stdin.readline().split())
def linput(): return list(map(int, stdin.readline().split()))
###############################################################

from collections import defaultdict
from math import factorial

def digitSum(m):
    sm = 0
    for e in str(m): sm += int(e)
    return sm

t = iinput()
while t:
    t -= 1
    n, s = minput()

    if digitSum(n) <= s:
        print(0)

    else:
        temp, x = 0, 0
        i = 0
        n = str(n)

        while temp <= s and i<len(n):
            temp += int(n[i])
            x = i
            i += 1
        ans = 0
        if temp > s:
            while x >= 0:
                if temp - int(n[x]) + 1 <= s:
                    if x == 0:
                        ans = int('1' + '0'*len(n))
                    else:
                        ans = int(str(int(n[:x])+1) + '0'*(len(n[x:])))
                    break
                else:
                    temp -= int(n[x])
                    x -= 1
            else:
                ans = int('1' + '0' * len(n))

        print(ans - int(n))