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:
for _ in range(int(input())):
    n, s = map(str, input().split())
    s = int(s)
    summa = 0
    steps = 0
    for item in n:
        summa += int(item)
    if summa > s:
        steps += 10 - int(n[-1])
        summa -= int(n[-1]) - 1
    counter = -1
    multi = 1
    while summa > s:
        counter -= 1
        multi *= 10
        item = int(n[counter])
        steps += multi * (9 - item)
        summa -= item
    print(steps)