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:
# think easy! this is not hard at all!

import sys
import heapq
si = sys.stdin.readline


def digitSum(n):
    n = str(n)
    ret = 0
    for e in n:
        ret += int(e)
    return ret


def main():
    t = int(si())
    while t:
        t -= 1
        n, s = [int(e) for e in si().split()]
        # q, r, num = s//9, s % 9, ''
        # if q:
        #     num += '9'
        # if r:
        #     num = str(r)+num
        # num = int(num)
        if digitSum(n) < s:
            print(0)
        else:
            i, temp = 10, n
            while digitSum(n) > s:
                n = n//i*i+i
                i *= 10
            print(n-temp)


if __name__ == '__main__':
    main()