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:
# -*- coding: utf-8 -*-
"""
Created on Fri Sep  4 22:30:44 2020

@author: Dark Soul
"""
def vang(n):
    d=0
    s=0
    while n:
        d+=1
        s+=n%10
        n=n//10
    return [d,s]
t=int(input(''))
dig=[]
for i in range(t):
    dig.append(list(map(int,input().split())))
for i in dig:
    n=i[0]
    s=i[1]
    num=list(str(n))
    for j in range(len(num)):
        num[j]=int(num[j])
    [ndig,sm]=vang(n)

    if sm<=s:
        print(0)
        continue
    else:
        cnt=0
        j=len(num)-1
        asi=0
        
        while sm>s:
            d=num[j]
            if sm<=s:
                break
            
            bodlise=10-d
            if d==0:
                j-=1
                asi+=1
                continue
            
            
            cnt+=bodlise*(10**asi)
            sm-=d
            sm+=1
            
            j-=1
            asi+=1
            num[j]+=1
            
            if j<0:
                break
        print(cnt)