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:

import collections
from functools import lru_cache
import bisect

INF = float("inf")
NEG_INF = float("inf")
ZERO = 0
ONE = 1


def read():
    return input().strip()


def readInt():
    return int(input().strip())


def readList():
    return list(map(int, input().strip().split()))


def solve(n, s):
    sNum = list(map(int, str(n)))
    nSum = sum(sNum)
    ans = 0
    N = len(sNum)

    for i, ch in enumerate(reversed(sNum)):
        if ch == 0:
            continue

        if nSum > s:
            ans += 10**i * ((10 - ch) % 10)
            sNum[N-i-1-1] += 1

            nSum -= ch
            nSum += 1

    return ans


t = readInt()
# [n,m] = readList()

for i in range(t):
    n, s = readList()

    print(solve(n, s))