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 collections import defaultdict as dd
import sys
input=sys.stdin.readline
t=int(input())
while t:
    #n=int(input())
    n,s=input().split()
    s=int(s)
    nn=int(n)
    n=list(map(int,n.strip()))
    #nn=list(n)
    i=len(n)-1
    su=sum(n)
    ans=0
    po=1
    num=0
    if(su<=s):
        print(0)
    else:
        while i>=0 and su+1>s:
            su-=n[i]
            po=po*10
            num=num+n[i]*(po//10)
            ans=po-num
            #print(po,num)
            i-=1
        print(ans)
    t-=1