import java.util.*;

public class B {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        B th = new B();
        for (int i = 0; i < T; i++) {
            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();
            int[] t = new int[n];
            for (int j = 0; j < n; j++) {
                t[j] = sc.nextInt();
            }
            int c = th.getAnswer(s,p,t);
            System.out.println("Case #" + (i+1) + ": " + c);
        }
    }
    public int getAnswer(int s, int p, int[] t) {
        int A1 = p + p-1+p-1;
        int A2 = p + p-2+p-2;
        if (A1 < 0)
            A1 = 0;
        if (A2 < 0)
            A2 = 1;
        int remain = s;
        int count = 0;
        int n = t.length;
        for (int i = 0; i < n; i++) {
            if (t[i] >= A1) {
                count++;
            } else if (t[i] < A1 && t[i] >= A2) {
                if (remain > 0) {
                    remain--;
                    count++;
                }
            }
        }
        return count;
    }
}


import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;

public class Dancing {

	public static int findmax(int N, int S, int p, ArrayList<Integer> googlers){
		int legit = 0;
		int surprise = 0;
		for(int g : googlers){
			if ( g >= (3*p) - 2){
				legit++;
			}
			else if(g > 0 && g >= (3*p) - 4){
				surprise++;
			}
		}
		return legit + Math.min(S, surprise);
	}//Dancing.findmax()


	public static void main(String[] args) throws IOException{

		String inputFile = args[0];
		String outputFile = args[1];
		File file = new File(inputFile);
		BufferedReader reader = new BufferedReader(new FileReader(file));
		BufferedWriter writer = new BufferedWriter(new FileWriter(outputFile));
		
		int numCases = Integer.parseInt(reader.readLine());
		
		for (int i = 1; i <= numCases; i++){
			int caseNumber = i;
			String[] arguments = reader.readLine().split(" ");
			int N = Integer.parseInt(arguments[0]);
			int S = Integer.parseInt(arguments[1]);
			int p = Integer.parseInt(arguments[2]);
			ArrayList<Integer> googlers = new ArrayList<Integer>();
			for(int j = 0; j < N; j++){
				googlers.add(Integer.parseInt(arguments[j+3]));
			}
			
			writer.write("Case #" + caseNumber + ": " + Dancing.findmax(N,S,p,googlers));
			writer.newLine();
		}
		reader.close();
		writer.close();
	}//Dancing.main()
}//Dancing
