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:
//package codeforces.div3_667;

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;

public class D_Decrease_the_Sum_Of_Digits {
    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String testcases = br.readLine();
        int tc = Integer.parseInt(testcases);
        for (int ii = 0; ii < tc; ii++){
            String[] line = br.readLine().split(" ");// Use string tokenizer less time
            long n;
            final int s;
            n=Long.parseLong(line[0]);
            s=Integer.parseInt(line[1]);
            String str=Long.toString(n);
            int sum=0,i;
            int totalSum=0;
            for(i=0;i<str.length();i++){
                totalSum+=str.charAt(i)-'0';
            }
            if(totalSum<=s){
                System.out.println(0);
                continue;
            }
            for(i=0;i<str.length();i++){
                sum+=str.charAt(i)-'0';
                if(sum>=s){
                    i--;
                    break;
                }
            }
            String ans="";
            boolean first=true;
            for(int j=str.length()-1;j>i;j--){
                if(first && str.charAt(j)=='0'){
                    ans="0"+ans;
                }else if ( first ){
                    ans=  (char)(10-(str.charAt(j)-'0') + 48)  + ans;
                    first=false;
                }else{
                    ans = (char)(9-(str.charAt(j)-'0') + 48) + ans;
                    first = false;
                }
            }
            //remove leading zeros
            first=true;
            for(int j=0;j<ans.length();j++){
                if(first==true && ans.charAt(j)=='0'){
                    //System.out.print(ans.charAt(j));
                }else{
                    System.out.print(ans.charAt(j));
                    first=false;
                }
            }
            System.out.println();
        }
    }
}