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:
from sys import *
from sys import *
t=int(stdin.readline())
for _ in range(t):
    n,s = map(int, stdin.readline().split())
    a=[]
    cnt=0
    i=n
    while i>0:
        a.append(i%10)
        i=i//10
        cnt+=1
    a=a[::-1]
    sum=a[0]
    cnt1=1
    f=0
    f1=0
    cnt2=0
    for i in range(1,cnt):
        if sum==s and f1==0:
            f1=1
            j=i
        if sum>s:
            if f1==1:
                a[j-1]=10
                cnt1-=cnt2
            else:
                a[i-1]=10
            f=1
            break
        sum+=a[i]
        cnt1+=1
        if f1==1:
            cnt2+=1
    if f1 == 1 and sum>s and f==0:
        a[j - 1] = 10
        cnt1 -= cnt2
    elif f==0 and sum>s:
        a[i]+=(10-a[i])
    x=10**(cnt-1)
    a1=0
    for i in range(cnt1):
        a1+=a[i]*x
        x=x//10
    print(a1-n)