import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

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

public class B implements Runnable
{	
	//private String IFILE = "input.txt";
	private String IFILE = "B-small-attempt0.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();
	}

}
