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.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();
	}
}

