/**
 * 
 */
package pandit.codejam;

import java.io.BufferedInputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.Scanner;

/**
 * @author Manu Ram Pandit
 * 
 */
public class DancingWithGooglersUpload {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		FileInputStream fStream = new FileInputStream(
				"input.txt");

		Scanner scanner = new Scanner(new BufferedInputStream(fStream));
		Writer out = new OutputStreamWriter(new FileOutputStream("output.txt"));

		int T = scanner.nextInt();
		int N,S,P,ti;
		int counter = 0;
		for (int count = 1; count <= T; count++) {
			N=scanner.nextInt();
			S = scanner.nextInt();
			counter = 0;
			P = scanner.nextInt();
			for(int i=1;i<=N;i++){
				ti=scanner.nextInt();
				if(ti>=(3*P-2)){
					counter++;
					continue;
				}
				else if(S>0){
					if(P>=2 && ((ti==(3*P-3)) ||(ti==(3*P-4)))) {
					S--;
					counter++;
					continue;
					}
				}
				
			}
			// System.out.println("Case #" + count + ": " + counter);
			out.write("Case #" + count + ": " + counter + "\n");
		}
		fStream.close();
		out.close();

	}

}


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

public class RQQ2 {
	
	public static void main(String[] args)
	{
		try
		{
			HashMap<Character,Character> map = new HashMap<Character,Character>();
			Scanner s = new Scanner(new File("B-small-attempt0.in"));
			FileWriter o = new FileWriter(new File("out.txt"));
			
			Integer lines = Integer.parseInt(s.nextLine());
			String str;
			Integer sup;
			Integer googlers;
			Integer p;
			StringTokenizer st;
			
			for (int i = 0; i < lines; i++)
			{
				o.write("Case #" + ( i + 1) + ": ");
				str = s.nextLine();
				st = new StringTokenizer(str, " ");
				googlers = Integer.parseInt(st.nextToken());
				sup = Integer.parseInt(st.nextToken());
				p = Integer.parseInt(st.nextToken());
				int even = 0;
				int max = 0;
				
				for (int j = 0; j < googlers; j++)
				{
					int total = Integer.parseInt(st.nextToken());
					if ( Math.ceil((double)total / 3.0) >= p )
					{
						max++;
					}
					else if ( total != 0 && Math.ceil((double)total/3.0 + 2.0/3.0) >= p)
					{
						even++;
					}
				}
				max += Math.min(even, sup);
				o.write("" + max + "\n");
			}
			
			s.close();
			o.close();
			
		}
		catch(Exception e)
		{
			System.out.println(e.getMessage());
			e.printStackTrace(System.out);
		}
	}
}
