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=int(input())
for i in range(t):
    n,s=map(int,input().split())
    arr=[]
    num=[]
    sum=0
    for j in str(n):
        arr.append(int(j))
        num.append(int(j))
        sum+=int(j)
    arr.reverse()
    num.reverse()
    if sum<=s:
        print(0)
    else:
        f=1
        j=0
        while(j<(len(arr))):
            sum-=num[j]
            if num[j]!=0:
                num[j]=0
                j+=1

                while (j < len(arr)):
                    if num[j] != 9:
                        num[j] += 1
                        sum += 1
                        break
                    else:
                        sum -= num[j]
                        num[j]=0
                        j += 1

            else:
                j+=1


            if j==len(arr):
                break





            if sum<=s:
                break
        if j==len(arr):
            num=[0]*(len(num))+[1]
        num.reverse()
        l=""
        for k in num:
            l+=str(k)
        print(int(l)-n)