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(s):
    cnt = 0
    for i in range(len(s)):
        cnt += ord(s[i]) - ord('0')
    return cnt

for _ in range(int(input())):
    n, k = [int(x) for x in input().split()]
    s = str(n)
    now = sum(s)
    if now <= k:
        print(0)
        continue
    bl = False
    for i in range(len(s) - 2, -1, -1):
        if s[i] == '9':
            s = s[:i] + '0'*(len(s)-i)
            continue
        char = chr(ord(s[i])+1)
        s = s[:i] + char + '0' * (len(s)-i-1)
        now = sum(s)
        if now <= k:
            bl = True
            break
    if bl == False:
        s = '1' + '0'*len(s)
    opa = int(s)
    print(opa - n)