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 math import ceil 
t=int(input())
for _ in range(t):
    n,s=map(int,input().split()) 
    digits=[0]*20
    n1=n
    i=0 
    sums=0 
    while n1:
        digits[i]=n1%10
        sums+=digits[i] 
        n1=n1//10 
        i+=1 
    i=0 
    while sums>s:
        if digits[i]:
            sums=sums-digits[i]+1  
            digits[i]=0 
            digits[i+1]+=1  
        i+=1
    res=0 
    m=1 
    for i in digits:
        res+=i*m 
        m=m*10 
    print(res-n)