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 sum1(a,b):
    s=str(a)
    r=0
    index = 0
    for i in s:
        if (r+int(i))>=b:
            
            return index
        
        r+=int(i)
        index+=1
    
    return -1
def sum2(a):
    s=str(a)
    r=0
    
    for i in s:
        r+=int(i)
    return r
    
        
for _ in range(int(input())):
    a,b=map(int,input().split())
    s=sum2(a)
    if s>b:
        index=sum1(a,b)
        k=len(str(a))-index
        if index==0:
            print(10**k - a)
        else:
            abc = int(str(int(str(a)[:index])+1)+((len(str(a))-index)*"0"))
            print(abc-a)
            
    else:
        print(0)