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:
#!/usr/bin/env python 3.74
# -*-coding:utf-8 -*-
def run_case():
    n, s = input().split()
    nn = list(n)
    s = int(s)
    if sum(map(int, nn)) <= s:
        print(0)
    else:
        temp = 0
        pre = 0
        for i in nn:
            temp += int(i)
            pre += 1
            if temp >= s:
                pre -= 1
                break
        if pre == 0:
            print(pow(10, len(nn)) - int(n))
        else:
            num = int(n[:pre])
            num += 1
            print(num * pow(10, len(nn) -pre) - int(n))

flag = 1
if flag:
    t = int(input())
    for i in range(t):
        run_case()
else:
    run_case()
#@Time: 2020/09/05 00:14:41