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 Thu Mar 26 20:38:21 2020

@author: Somik Dhar
"""

m = int(input())
a = []
n = m
for i in range(0,n):
    
    b = input()
    
    a.append(b)
   
'''def divisibility_check(a,b):
    
    return count '''   

for i in range(0,m):
    k = a[i]
    x = [int(y) for y in k.split()]
   # print(divisibility_check(x[0],x[1]))
    count = 0
    if x[0] > x[1] and x[0]%x[1] != 0:
        h = x[0]%x[1]
        count = count + x[1] - h
    elif x[0] < x [1]:
        count = count + x[1] - x[0]
    print(count)