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.FileReader;
import java.io.FileWriter;
import java.io.IOException;

public class Dancing_With_the_Googlers {
	public static void main(String[] args) {
		try {
			BufferedReader in = new BufferedReader(new FileReader("B-large.in"));
			BufferedWriter out = new BufferedWriter(new FileWriter("B-large.out"));
			Dancing_With_the_Googlers x = new Dancing_With_the_Googlers();
			String str;
			in.readLine();
			while ((str = in.readLine()) != null) {
				String res = x.convert(str);
				out.write(res+"\n");
			}
			in.close();
			out.close();
		} catch (IOException e) {
			e.printStackTrace();
			}
	}
	int count=1;
	String convert(String in)
	{
		String op[] = in.split(" ");
	    int no_of_googlers = Integer.parseInt(op[0]);
	    int suprisingTriplets = Integer.parseInt(op[1]);
	    int bestresult = Integer.parseInt(op[2]);
		int current_googler_score = 0;
		int valid_score  = 0;
		int min_best_score = bestresult+2*(bestresult-1);
		if (min_best_score == 0){ valid_score = no_of_googlers;return "Case #"+(count++)+": "+valid_score;}
		int sup =0;
		for (int i=0; i<no_of_googlers; i++){
		current_googler_score = Integer.parseInt(op[3+i]);
			if ( current_googler_score >= min_best_score) {
			valid_score++;
			}
			else if ( current_googler_score == min_best_score-1 || current_googler_score == min_best_score-2 ){
			if ( current_googler_score != 0){
			sup++;
			}
			}
		}
		if( suprisingTriplets <= sup ){
		valid_score = valid_score + suprisingTriplets;
		}
		else {
		valid_score = valid_score + sup;
		}
		return "Case #"+(count++)+": "+valid_score;
	}
	
}
