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;
    }
}


package ulohy;

import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;

public class Codejam_2 {
	
	static byte cases;
	static int[] googlers = new int[100];
	static int[] supr_triplets = new int[100];
	static int[][] total_scores = new int[100][100];
	static int[][] max = new int[100][100];
	static int[][] supr_max = new int[100][100];
	static int[] treshold = new int[100];
	static int[] result = new int[100];
	
	public static void read_input() {
		
		Scanner s = null;
		try {
			s = new Scanner(new FileReader("./src/ulohy/B-small-attempt0.in"));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
		
		cases = s.nextByte();		
		
		for (int i = 0; i < cases; i++) {
			googlers[i] = s.nextInt();
			supr_triplets[i] = s.nextInt();
			treshold[i] = s.nextInt();
			for (int j = 0; j < googlers[i]; j++) {
				total_scores[i][j] = s.nextInt();				
			}			
		}

		s.close();	
	}
	
	public static void write_output() {
		FileWriter outFile;
		try {
			outFile = new FileWriter("./src/ulohy/output");		
			PrintWriter out = new PrintWriter(outFile);
			for (int i = 1; i <= cases; i++) {
				out.println("Case #"+i+": "+result[i-1]);				
			}
			out.close();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}	
	
	public static void main(String args[]) {
		
		read_input();
		
		for (int i = 0; i < cases; i++) {			
			for (int j = 0; j < googlers[i]; j++) {
				if (total_scores[i][j] > 0) {
					switch (total_scores[i][j] % 3) {
					case 0:
						max[i][j] = total_scores[i][j]/3;
						supr_max[i][j] = total_scores[i][j]/3 + 1;
						break;
					case 1:
						max[i][j] = total_scores[i][j]/3 + 1;
						supr_max[i][j] = total_scores[i][j]/3 + 1;
						break;
					case 2:
						max[i][j] = total_scores[i][j]/3 + 1;
						supr_max[i][j] = total_scores[i][j]/3 + 2;
						break;
					default:
						break;
					}
				}
			}
			
			for (int j = 0; j < googlers[i]; j++) {
				if (max[i][j] >= treshold[i]) {
					result[i]++;
				} else {
					if (supr_max[i][j] >= treshold[i] && supr_triplets[i] > 0) {
						result[i]++;
						supr_triplets[i]--;
					}
				}
			}
		}
		
		write_output();
		
	}

}
