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 = eval(input())
for case in range(t):
    n,s = input().split(" ")
    s = int(s)
    sumx = 0
    sum1 = 0
    ans = [0]
    flag = 0
    for i in n:
        sum1+=int(i)
    if sum1 <= s:
        print(0)
        continue
    for i in n:
        sumx += int(i)
        if sumx >= s and flag==0:
            ans[-1] = ans[-1]+1
            flag = 1
        if flag:
            ans.append(0)
        else:
            ans.append(int(i))
    k = 0
    for i in ans:
        k = k*10+i
    print(k-int(n))