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.*;
import java.util.*;

public class Main {

    static int sumOD(long num){
        int ans = 0, z = 10;
        while(num>0){
            ans += num%z;
            num=(num/z);
        }
        return ans;
    }

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int tst = Integer.parseInt(br.readLine());
        StringBuilder sb = new StringBuilder();
        while(tst-->0){
            String[] str = br.readLine().split(" ");
            long num = Long.parseLong(str[0]);
            int s = Integer.parseInt(str[1]);
            boolean poss = false;
            long org = num;
            long moves = 0, z = 10;
            while(!poss){
                if(sumOD(num)<=s) poss = true;
                else{
                    num = num - (num%z) + z;
                    z*=10;
                }
            }
            moves = num-org;
            sb.append(moves).append('\n');
        }
        System.out.println(sb);
    }
}