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:
t = int(input())
def check_sum(n):
    s = 0
    for i in n:
        s += int(i)
    return s
while t:
    a = input().split()
    n, s = int(a[0]), int(a[1])
    moves = 0
    sumi = check_sum(str(n))
    if sumi <= s:
        print(0)
        t -= 1
        continue
    l = len(str(n))
    cnt = 1
    orig = str(n)
    old_no = str(n)
    while sumi > s:
        new_no = orig[0:l - cnt] + '9'*cnt
        moves = int(new_no) - int(orig)
        sumi = check_sum(orig[0:l - cnt]) + 1
        # print(new_no,sumi)
        cnt += 1

    print(moves+1)
    t -= 1