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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;

public class D {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(System.out);
        StringBuilder sb = new StringBuilder("");
        int t = Integer.parseInt(br.readLine());
        while(t-->0) {
            String[] in = br.readLine().split(" ");
            long n = Long.parseLong(in[0]);
            long k = Long.parseLong(in[1]);
            long pow = 1L;
            long ans = 0L;
            while(count(n, k)){
                long v = (10-(n/pow)%10)*pow;
                n = n+v;
                ans+=v;
                pow = pow * 10;
            }
            sb.append(ans+"\n");

        }

        out.print(sb);
        out.flush();
        br.close();
    }

    public static boolean count(long n, long k){
        long val = 0L;
        while(n>0){
            val+=n%10;
            n=n/10;
        }
        return val>k;
    }
}