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:
def func(x):
    y=list(str(x))
    s=0
    for i in y:
        s+=int(i)
    return s


for _ in range(int(input())):
    n,s=map(int, input().split())
    n=str(n)
    if func(int(n))<=s:
        print(0)
    elif int(n[0])>s:
        ans='1'+'0'*(len(n))
        
        print(int(ans)-int(n))
    else:
        
                
        
        i=0
        sum=0
        while i<len(n):
            sum+=int(n[i])
            
            if sum>=s:
                break
            else:
                i+=1
        
        s1='0'*(len(n)-(i+1))
        k=int(n[: i+1])
        k+=1
        
        i=0
        while func(k)>s:
            k+=1
        k=str(k)
        
        ans=int(k+s1)
        print(ans-int(n))