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 JAVA):

Solution:
import java.util.*;
import java.lang.*;

public class Solution {
    public static boolean sum(long n,long m)
    {
        long num = 0;
        while(n>0)
        {
            num += n%10;
            n = n/10; 
        }
        if(num<=m)
            return true;
        else
            return false;

    }
    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        while(t>0)
        {
            long n;
            long s;
            n = sc.nextLong();
            s = sc.nextLong();
            long p = 10;
            long carry = 0;
            long add = 0;
            long dec = 10;
            if(sum(n,s))
            {
                System.out.println("0");
                t--;
                continue;
            }
            for(int i = 0 ; i <= (int)Math.log((double)n) ;i++)
            {
                long digit = n%p;
                digit = digit/(p/10);
                add += (10-digit-carry)*(p/10);
                if(sum(n+add,s))
                    break;
                carry = 1;
                p = p*10;
            }
            System.out.println(add);
            t--;
        }
    }

}