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 Mon Aug  3 21:10:40 2020

@author: dennis
"""

import atexit
import io
import sys
 
_INPUT_LINES = sys.stdin.read().splitlines()
input = iter(_INPUT_LINES).__next__
_OUTPUT_BUFFER = io.StringIO()
sys.stdout = _OUTPUT_BUFFER
 
@atexit.register
def write():
    sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())

for case in range(int(input())):
    n, s = [int(x) for x in input().split()]
    if sum(int(x) for x in str(n)) > s:
        sum_ = 0
        for i, c in enumerate(str(n)):
            x = int(c)
            if sum_ + x + 1 > s:    
                ans = 10**(len(str(n)) - i) - int(str(n)[i:])
                print(ans)
                break
            sum_ += x
    else:
        ans = 0
        print(ans)