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 Oct  5 20:49:46 2020

@author: feibiaodi
"""

n=int(input())
for i in range(0,n):
    a,b=[int(x) for x in input().split()]
    if a%b!=0:
        print((a//b+1)*b-a)
    else:
        print(0)
'''c,d=[int(x) for x in input().split()]
e,f=[int(x) for x in input().split()]
g,h=[int(x) for x in input().split()]
p,q=[int(x) for x in input().split()]'''
 
'''   
if c%d!=0:
    print((c//d+1)*d-c)
else:
    print(0)
if e%f!=0:
    print((e//f+1)*f-e)
else:
    print(0)
if g%h!=0:
    print((g//h+1)*h-g)
else:
    print(0)
if p%q!=0:
    print((p//q+1)*q-p)
else:
    print(0)'''