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

def sod(n):
    if n<10:
        return n 
    return n%10 + sod(n//10)

def func(s):
    flag = False 
    
    for i in range(len(s)-1,-1,-1):
        if s[i] != '9':
            ans = s[:i] + str(int(s[i])+1) + '0'*(len(s)-i-1)
            flag = True
            break 
    if flag:
        return ans 
    return '1'+len(s)*'0'  


for _ in range(int(input())):
    (n,s) = map(int,input().split())
    k = sod(n) 
    if k <= s:
        print(0)
        continue
    n1 = str(n)
    if k > s:
        sum = 0
        kp = ''
        for i in range(len(n1)):
            sum += int(n1[i])
            if sum>=s:
                ans = func(kp)+'0'*(len(n1)-i)
                print(int(ans)-n)
                break 
            kp+=n1[i]