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 io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
t=int(input())
for i in range(t):
    n,s=list(map(int,input().split()))
    m=str(n)
    p=0
    lis=[]
    l=len(m)
    for j in m:
        p+=int(j)
        lis.append(int(j))
    if p<=s:
        print(0)
    else:
        j=l-1
        ans=0
        while p>s and j>=0:
            if lis[j]!=0:
                p-=lis[j]
                ans+=(((10)**(l-j-1))*(10-lis[j]))
                lis[j]=0
                j-=1
                while j>=0 and p+1>s:
                    if lis[j]!=9:
                        p+=1
                        lis[j]+=1
                        break
                    else:
                        p-=9
                        lis[j]=0
                        j-=1
            else:
                j-=1
        print(ans)