package dancinggooglers;

import java.io.File;
import java.util.Scanner;

public class DanceScoreCalculator {


    public static void main(String[] args) {
        if(args.length <= 0 || args[0] == null) {
            System.out.println("You must enter a file to read");
            System.out.println("Usage: blah <filename>");
            System.exit(0);
        }

        File argFile = new File(args[0]);
        try {
            Scanner googleSpeakScanner = new Scanner(argFile);
            String firstLine = googleSpeakScanner.nextLine();
            Integer linesToScan = new Integer(firstLine);
            for(int i = 1; i <= linesToScan; i++) {
                String googleDancerLine = googleSpeakScanner.nextLine();
                DanceScoreCase danceCase = new DanceScoreCase(googleDancerLine);
                System.out.println(String.format("Case #%d: %d", i, danceCase.maxDancersThatCouldPass()));
            }
        }
        catch (Exception e) {
            e.printStackTrace();
        }
    }
}

import java.io.*;
import java.util.*;

public class B implements Runnable
{	
	//private String IFILE = "input.txt";
	//private String IFILE = "B-small-attempt0.in";
	private String IFILE = "B-large.in";
	
	private Scanner in;
	private PrintWriter out;
	
	public void Run() throws IOException
	{
		in = new Scanner(new File(IFILE));
		out = new PrintWriter("output.txt");
		
		int ntest = in.nextInt();
		for(int test = 1; test <= ntest; test++)
		{
			out.print("Case #" + test + ": ");
			int n = in.nextInt();
			int m = in.nextInt();
			int p = in.nextInt();
			int[] mas = new int[n];
			for(int i = 0; i < n; i++)
				mas[i] = in.nextInt();

			int[] max1 = new int[31];
			for(int i = 1; i <= 10; i++)
				max1[Math.max(0, Math.min(30, 3 * i - 2))] = i; 
			int[] max2 = new int[31];
			for(int i = 1; i <= 10; i++)
				max2[Math.max(1, Math.min(30, 3 * i - 4))] = i;
			for(int i = 1; i <= 30; i++)
				max1[i] = Math.max(max1[i], max1[i - 1]);
			for(int i = 1; i <= 30; i++)
				max2[i] = Math.max(max2[i], max2[i - 1]);
			
			int n1 = 0;
			int n2 = 0;
			for(int i = 0; i < n; i++)
			{
				if (max1[mas[i]] >= p)
					n1++;
				else if (max2[mas[i]] >= p)
					n2++;
			}
			
			out.println(n1 + Math.min(n2, m));
		}
		
		in.close();
		out.close();
	}
	
	public void run()
	{
		try		
		{
			Run();
		}
		catch(IOException e)
		{
			
		}
	}

	public static void main(String[] args) throws IOException
	{
		new B().Run();
		//new Thread(new XXX()).start();
	}

}
