/**
 * 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.Scanner;

public class Googlers {
	public static void main(String a[]){
		Scanner in = new Scanner(System.in);
		final int T = in.nextInt();
		int[] n = new int[T];
		
		int N, S, P, sum;
		for(int i = 0; i < T; i++){
			N = in.nextInt();
			S = in.nextInt();
			P = in.nextInt();
			
			for(int j = 0; j < N; j++){
				sum = in.nextInt();
				//System.out.println(sum);
				//System.out.println("S " + sum + " P " + P);
				/*
				if(sum <= P){
					n[i]+= 0;
					//System.out.println(sum + "cero");
				}*/
				//else {
					//System.out.println("aasdfas");
					//int resta = sum - P;
					if(sum == 0 &&  P == 0){
						n[i]++;
					}
					else if(sum == 0 && P > 0){
						n[i]+=0;
					}
					else if(sum >= (P + (P-1) + P)){
						//System.out.println("aasdf");
						//System.out.println("1");
						n[i]++;
					}
					else if(sum >= P + P + P){
						n[i]++;
						//System.out.println("2");
					}
					else if(sum >= P + 1 + P + 1 + P + 1){
						n[i]++;
						//System.out.println("3");
					}
					else if(sum >= P + 2 + P + 2 + P + 2){
						n[i]++;
						//System.out.println("4");
					}
					else if(sum >= (P-1) + (P-1) + P){
						n[i]++;
						//System.out.println("5");
					}
					else if(sum >= (P+1) + (P+1) + P){
						n[i]++;
						//System.out.println("6");
					}
					else if(sum >= (P+1) + P + P){
						n[i]++;
						//System.out.println("7");
					}
					else if((sum >= (P+1) + (P-1) + P) && S > 0){
						n[i]++;
						S--;
						//System.out.println("8");
					}
					else if((sum >= (P + (P-1) + (P-2))) && S > 0){
						n[i]++;
						S--;
						//System.out.println("9");
					}
					else if((sum >= (P + (P-2) + (P-2))) && S > 0){
						n[i]++;
						S--;
						//System.out.println("10");
					}
					else if((sum >= (P + (P+1) + (P-1))) && S > 0){
						n[i]++;
						S--;
						//System.out.println("11");
					}
					else if((sum >= (P + (P+2) + (P+2))) && S > 0){
						n[i]++;
						S--;
						//System.out.println("12");
					}
					else if((sum >= (P + (P+2) + P)) && S > 0){
						n[i]++;
						S--;
						//System.out.println("13");
					}
					else if((sum >= (P + (P+1) + (P+2))) && S > 0){
						n[i]++;
						S--;
						//System.out.println("14");
					}
					
					/*
					else if(Math.abs((resta / 2) -  P) == 2){
						if(S > 0){
							S--;
							n[i]++;
							//System.out.println("s");
						}
					}
					else if((resta / 2) - P == 0 || Math.abs(resta / 2 - P) ==1){
						n[i]++;
						//System.out.println("parejo");
					}*/
				}
			}
		//}
		for(int i = 0; i < T; i++){
			System.out.println("Case #" + (i+1) + ": " + n[i]);
		}
	}
}
