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

public class DancingWithTheGooglers
{
	public static void main (String[] args)
	{
		File f = getFile();
		decodeAndWrite(f);
	}
	
	public static File getFile ()
	{
		Scanner in = new Scanner (System.in);
		System.out.print("Please enter the name of the file to be decoded (include extension!) -> ");
		String s = in.next();
		return new File(s);	
	}
	
	public static void decodeAndWrite (File f)
	{
		Scanner inf = null;
		PrintWriter outf = null;
		
		try
		{
			inf = new Scanner(f);
			outf = new PrintWriter(new File("dancing_results.txt"));
		}
		catch (FileNotFoundException e)
		{
			System.err.println("That is not a valid filename. Please re-run the program with a valid filename");
			System.exit(1);
		}
		
		int T = inf.nextInt(), N = 0, S = 0, p = 0, ti = 0, count = 0, scount = 0;
		
		for (int i = 1; i <= T; i++)
		{
			scount = count = 0;
			N = inf.nextInt();
			S = inf.nextInt();
			p = inf.nextInt();
			for (int j = 0; j < N; j++)
			{
				ti = inf.nextInt();
				if (ti >= (3 * p) - 2)
					count++;
				else if ((3 * p) - 4 >= 0 && ti >= (3 * p) - 4 && scount < S)
					scount++;
			}
			count += scount;
			System.out.println("Case #" + i + ": " + count);
			outf.println("Case #" + i + ": " + count);
		}
		
		inf.close();
		outf.close();
	}
}

