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:
import math
t = int(input())
for _ in range(t):
    n, s = [int(i) for i in input().split()]
    n1 = str(n)
    ans = math.inf
    count = 0
    a1 = 0
    for i in range(len(n1)):
        a1 += int(n1[i])
    if a1 <= s:
        print(0)
    else:
        for i in range(len(n1)):
            if count+int(n1[i]) >= s:
                if count + int(n1[i]) > s:
                    if i == 0:
                        temp = int(str(10)+'0'*len(n1[i+1:]))
                        ans = min(ans, temp - n)
                        count += (int(n1[i]))
                    else:
                        break
                if count + int(n1[i]) == s:
                    t1 = 0
                    for j in range(i+1, len(n1)):
                        t1 += int(n1[j])
                    if t1 == 0:
                        if i == 0:
                            ans = 0
                        break
                    else:
                        if i == 0:
                            temp = int(str(10) + '0'*len(n1[i+1:]))
                            ans = min(ans, temp - n)
                            count += (int(n1[i]))
                        break
            elif count + int(n1[i]) < s:
                temp = int(n1[:i] + str(int(n1[i])+1) + '0'*len(n1[i+1:]))
                ans = min(ans, temp - n)
                count += (int(n1[i]))
        print(ans)