/**
 * Created by IntelliJ IDEA.
 * User: Administrator
 * Date: 3/3/12
 * Time: 11:00 AM
 * To change this template use File | Settings | File Templates.
 */

import SRMLib.MathLibrary;
import SRMLib.TestSRMLib;
import com.sun.org.apache.bcel.internal.generic.F2D;

import java.io.*;
import java.util.*;
import java.util.zip.Inflater;

public class SRM {
    public static void main(String[] args) throws IOException {
        //TestSRMLib.run();
        codeJam1.main();

        return;
    }
}
class codeJam1 {
    public static void main() throws IOException {
        String inputPath = "E:\\input.txt";
        String outputPath = "E:\\output.txt";
        BufferedReader input = new BufferedReader(new FileReader(inputPath));
        BufferedWriter output = new BufferedWriter(new FileWriter(outputPath));

        String line;
        line = input.readLine();
        int T = Integer.parseInt(line);
        for (int i = 1; i <= T; ++i) {
            line = input.readLine();
            String[] words = line.split(" ");
            int N = Integer.parseInt(words[0]);
            int S = Integer.parseInt(words[1]);
            int p = Integer.parseInt(words[2]);
            int n = 0;
            int res = 0;

            for (int j = 3; j < words.length; ++j) {
                if (p == 0) {
                    res++;
                    continue;
                }

                int t = Integer.parseInt(words[j]);
                if (p == 1) {
                    if (t > 0)
                        res++;
                    continue;
                }
                if (t >= 3 * p - 2)
                    res++;
                else if (t >= 3 * p - 4)
                    n++;
            }

            res += Math.min(n, S);
            output.write("Case #" + i + ": " + res);
            output.newLine();
        }

        input.close();
        output.close();
    }
}

import java.util.*;
import java.math.*;

public class dancingGooglers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner scan = new Scanner(System.in);
		int numStrings = scan.nextInt();
		
		for(int i =1; i <= numStrings; i++){
			int numGooglers = scan.nextInt();
			int numSurprises = scan.nextInt();
			int p = scan.nextInt();
			
			int[] totalScores;
			totalScores = new int[numGooglers];
			
			int withoutSurpriseCount, withSurpriseCount;
			withoutSurpriseCount = 0 ;
			withSurpriseCount = 0;
			
			for(int j = 1; j <= numGooglers; j++){
				
				totalScores[j-1] = scan.nextInt();
				
				if(totalScores[j-1] >= p + 2*Math.max(p-1, 0)){
					withoutSurpriseCount = withoutSurpriseCount + 1;
				}
				else if(totalScores[j-1] >= p + 2*Math.max(p-2,0)){
					withSurpriseCount = withSurpriseCount + 1;
				}
			}
			
			//System.out.println("\n " + numGooglers + " " + numSurprises + " " + withoutSurpriseCount + " " + withSurpriseCount);
			
			int temp1 = Math.min(withSurpriseCount, numSurprises);
			int temp2 = temp1 + withoutSurpriseCount;
			int temp3 = Math.min(numGooglers, temp2);
			
			System.out.format("Case #%d: %d\n", i, temp3);
		
		}
	}

}
