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

int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

inf=10**19
for _ in range(II()):
    t,s=SI().split()
    n=len(t)
    s=int(s)
    if sum(int(c) for c in t)<=s:
        print(0)
        continue

    i=0
    while i<n and s>0:
        s-=int(t[i])
        i+=1
    # print(i)

    ans=[]
    m=0
    for j in range(n-1,i-2,-1):
        a=int(t[j])
        if a+m==0:ans.append(0)
        else:
            ans.append(10-a-m)
            m=1
    while len(ans)>1 and ans[-1]==0:ans.pop()
    print(*ans[::-1],sep="")