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(int, input().split())
    a = [int(k) for k in str(n)]
    if sum(a) <= s:
        print(0)
        continue
    total = 0
    i = 0
    while i < len(a):
        if a[i] + total < s:
            total += a[i]
            i += 1
        else:break
    if i == len(a):
        print(0)
        continue
    if i == 0:
        print(10**(len(a)) - n if sum(a) > s else 0)
        continue
    for j in range(i-1, -1, -1):
        if a[j] == 9:
            a[j] = 0
        else:
            a[j] += 1
            break
    for j in range(i, len(a)):a[j] = 0
    #print("->", a, i)
    ans = int("".join(str(k) for k in a)) - n
    print(ans if ans >= 0 else 10**(len(a)) - n)