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 decimal import *
import random

def sm(s):
    ans = 0
    for i in range(len(s)):
        ans+=s[i]
    return ans
def fix(arr, pnt):
    if(pnt<0):
        arr = [1]+arr
        return arr
    arr[pnt]+=1
    if(arr[pnt]==10):
        narr = list(arr)
        narr[pnt] = 0
        return fix(narr, pnt-1)
    else:
        return arr

for _ in range(int(input())):
    n,k = map(int, input().split())
    arr = []
    for i in range(len(str(n))):
        arr.append(int(str(n)[i]))
    mult = 0
    ans = 0
    pnt = len(arr)-1
    while(sm(arr)>k):
        if(arr[pnt]==9):
            arr = fix(arr, pnt)
            ans+=(10**mult)
            pnt-=1
            mult+=1
        else:
            arr[pnt]+=1
            ans+=(10**mult)
        
    print(ans)