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 sys
import math
# import numpy as np
fast_reader=sys.stdin.readline
fast_writer=sys.stdout.write
 
def input():
    return fast_reader().strip()
 
# def print(*argv):
#     fast_writer(' '.join((str(i)) for i in argv))
#     fast_writer('\n') 
#############################################################################################
for T in range(int(input())):
    n,s=map(int,input().split())
    sum=0;big=0
    num=str(n);same=False;ind=0
    for i in range(len(num)):
        sum+=int(num[i])
        if(sum==s and same==False):
            ind=i
            big=num[i:]
            same=True
        elif(sum>s):
            if(same==False):
                big=num[i:]
                ind=i
            break
    big=int(big)

    if(sum<=s):
        print(0)
    else:
        l=len(num)
        l-=ind
        diffFrom=10**l
        # print(ind,diffFrom,big,l)
        print(diffFrom-big)