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.util.Scanner;


public class B {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int nbr_case = scan.nextInt();
		for(int i = 0; i < nbr_case; i++)
		{
			int N = scan.nextInt();
			int S = scan.nextInt();
			int p = scan.nextInt();
			int possible_max = 0;
			int curr =0;
			//int[] vec = new int[N];
			for( int j = 0; j<N;j++)
			{
				
				curr = scan.nextInt();
				if(S> 0)
				{
					if(curr > (p*3 - 3) && (curr >= p))
					{
						possible_max++;
					}					
					else
					{
						if(curr > (p*3-5) && (curr >= p))
						{
							possible_max++;
							S--;
						}
						
					}
					
				}
				else
				{
					
					if(curr > (p*3 - 3) && (curr >= p))
					{
						possible_max++;
					}
					
				}
				

					//vec[j] = scan.nextInt();				
			}
			//System.out.println(vec.toString());
			System.out.format("Case #%d: %d\n", i+1, possible_max);
		}
		

	}

}
