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:
#!/bin/python3
import math; import os; import random; import re; import sys
from collections import defaultdict, Counter, deque
import heapq
from functools import lru_cache
from itertools import accumulate, chain, combinations, permutations, groupby, zip_longest
from math import floor, ceil, sqrt

t = int(input())
res = []

def f(n,s):
	if sum(int(ch) for ch in str(n)) <= s:
		return 0
	l = len(str(n))
	for p in range(1, l+1):
		v = n%(10**p)
		add = 10**p - v
		new = n + add
		if sum(int(ch) for ch in str(new)) <= s:
			return add

for _ in range(t):
	n, s = map(int, input().split())
	res += f(n,s),

for v in res:
	print(v)