import java.io.*;
import java.math.*;
import java.util.*;
import java.text.*;

public class b {
    public static void main(String[] args) {
        Scanner sc = new Scanner(new BufferedInputStream(System.in));

        int T = sc.nextInt();

        for (int casenumber = 1; casenumber <= T; ++casenumber) {

            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();

            int[] ts = new int[n];
            for (int i = 0; i < n; ++i)
                ts[i] = sc.nextInt();

            int thresh1 = (p == 1 ? 1 : (3 * p - 4));
            int thresh2 = (3 * p - 2);

            int count1 = 0, count2 = 0;

            for (int i = 0; i < n; ++i) {
                if (ts[i] >= thresh2) {
                    ++count2;
                    continue;
                }
                if (ts[i] >= thresh1) {
                    ++count1;
                }
            }

            if (count1 > s) {
                count1 = s;
            }

            System.out.format("Case #%d: %d%n", casenumber, count1 + count2);
        }
    }
}

//import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;


public class jammo {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
			Scanner scanner = new Scanner(new File("input.txt"));
			//FileWriter fstream = new FileWriter("output.txt");
			//BufferedWriter out = new BufferedWriter(fstream);
			PrintWriter out = new PrintWriter(new FileWriter("output.txt"));
			int inputSet,partC,surpC,minDM,curTot,noSurp,surpCo,total;
			inputSet = scanner.nextInt();
        
			for(int i=1; i<=inputSet; i++) 
            {	
				partC = scanner.nextInt();
				surpC = scanner.nextInt();
				minDM = scanner.nextInt();
				noSurp = 0;
				surpCo = 0;
                
				for(int j=0; j<partC; j++)
                {
					curTot = scanner.nextInt();
					if(minDM==1 && curTot>=1)
							noSurp++;
					else if(curTot>=3*minDM-2)
						noSurp++;
					else if(curTot>=3*minDM-4)
						surpCo++;
				}
                
				total = noSurp + Math.min(surpC,surpCo);
				out.println("Case #"+i+": "+total);
				System.out.print("Case #"+i+": "+total+"\n");
			}
        
			out.close();
			return;
		}
}
