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.*;
import java.util.*;
public class q2Alt{
public static void main (String[] args) throws IOException 
    {
	BufferedReader input = new BufferedReader (new FileReader ("B-small-attempt0.txt"));
	PrintWriter output = new PrintWriter (new FileWriter("test2DoneAlt.out"));
	StringTokenizer st;
	
	int numOfLine = Integer.parseInt(input.readLine());
	for(int i = 0; i < numOfLine; i++){
	    st = new StringTokenizer(input.readLine());
	    int N = Integer.parseInt(st.nextToken());
	    int S = Integer.parseInt(st.nextToken());
	    int P = Integer.parseInt(st.nextToken());
	    int better = 0;
	    int[] scores = new int [N];
	    
	    for(int j = 0; j < N; j++){
		scores[j] = Integer.parseInt(st.nextToken());
	    }
	    
	    for(int j = 0; j < N; j++){
		int reduction = scores[j] - P;
		if(reduction < 0){}
		else if(reduction >= 2*(P - 1)){
		    better ++;
		}
		else if(reduction >= 2*(P-2) && S > 0){
		    better ++;
		    S --;
		}
	    }
	    
	    output.println("Case #" + (i+1) + ": " + better);
	}
	output.close();
    }
}          
