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 sys
input=sys.stdin.readline

t=int(input())
for _ in range(t):
    n, s=map(int, input().split())

    N=[]
    for i in str(n):
        N.append(int(i))
    N.reverse()
    N.append(0)
    ans=0
    for i in range(len(str(n))):
        if sum(N)<=s:
            break
        if N[i]==0: continue
        if N[i]==10: 
            N[i]=0
            N[i+1]+=1
            continue

        ans+=(10-N[i])*pow(10, i)
        N[i]=0
        N[i+1]+=1
        
    print(ans)