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:
def sum_digit_func(x):
	sum_digit = 0
	while x != 0:
		sum_digit += x % 10
		x = x // 10
	return sum_digit

def count_digit_less_func(x, s):
	sum_digit = 0
	x = str(x)
	count_digit = len(x)
	while sum_digit < s:
		sum_digit += int(x[0])
		x = x[1:]
		count_digit -= 1
	return count_digit + 1

def task_D():
    t = int(input())
    for _ in range(t):
        n, s = map(int, input().split())
        sum_digit = sum_digit_func(n)
        if sum_digit <= s:
        	print(0)
        else:
        	count_digit = count_digit_less_func(n, s)
        	print(10 ** count_digit - n % 10 ** count_digit)



def main():
    task_D()

if __name__ == '__main__':
    main()