/**
 * 
 */
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.HashMap;
import java.util.Map;

public class ProblemB {
	public static void main(String argv[])
	{
		IOSystem ioSystem = new IOSystem("problem/B-small-attempt0");
////		IOSystem ioSystem = new IOSystem("problem/A-small-attempt2");
//		IOSystem ioSystem = new IOSystem("problem/test");

		ioSystem.nextLong();
		while(ioSystem.hasNext())
		{
			int N = ioSystem.nextInt();
			int S = ioSystem.nextInt();
			int P = ioSystem.nextInt();

			int koeru = 0;
			int supKoeru = 0;

			for(int i=0;i<N;i++)
			{
				int t = ioSystem.nextInt();
				if(t==0)
				{
					if(P == 0)koeru++;
					continue;
				}
				if(t==1)
				{
					if(P <= 1)koeru++;
					continue;
				}



				//3ã¤ã«åãã
				if(t%3==0)
				{
					if(t/3>= P)
					{
						koeru++;
					}
					else if(t/3 + 1>= P)
					{
						supKoeru++;
					}
				}
				else if(t%3 == 2)
				{
					if(t/3 + 1>= P)
					{
						koeru++;
					}
					else if(t/3 + 2>= P)
					{
						supKoeru++;
					}
				}
				else
				{
					if(t/3 + 1 >= P)
					{
						koeru++;
					}
				}
			}

			System.out.println(N+","+S+","+P+","+koeru+","+supKoeru);

			if(supKoeru > S)
			{
				koeru += S;
			}
			else
			{
				koeru += supKoeru;
			}


			ioSystem.appendAnswer(koeru);
		}

		ioSystem.output();
	}
}


