import java.io.BufferedWriter;
import java.io.File;
import java.io.FileOutputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Scanner;


public class Dancing_With_the_Googlers {


    /**
     * The first line of the input gives the number of test cases, T.
     *  T test cases follow. 
     *  Each test case consists of a single line containing integers separated by single spaces. 
     *  The first integer will be N, the number of Googlers, and the second integer will be S, the number of surprising triplets of scores. 
     *  The third integer will be p, as described above. Next will be N integers ti: the total points of the Googlers. 
     * @throws IOException
     */
	   public static void main(String[] args) throws IOException {
	        // TODO Auto-generated method stub
			// Reading the input file
			Scanner in = new Scanner(new File("B-large.in"));
			// writting the input file
			FileOutputStream fos = new FileOutputStream("B-large.out");
			PrintStream out = new PrintStream(fos);
	         //Close the output stream
	        int testCase=Integer.parseInt(in.nextLine());
	        for(int i=0;i<testCase;i++) {
	        	out.print("Case #" + (i + 1) + ":\t");
	        	int NoOfGooglers= in.nextInt();
	        	int NoOfSurprisingResults = in.nextInt();
	        	int atLeastP=in.nextInt();
	        	ArrayList<Integer> scores= new ArrayList<Integer>();
        		int BestResults=0;
        		int Surprising=0;
	        	for(int j=0;j<NoOfGooglers;j++)
	        	{
	        		scores.add(in.nextInt());
	        		//System.out.print(scores.get(j));
	        		int modulus=scores.get(j)%3;
	        		int temp = scores.get(j);
	    			switch (modulus) {
					case 0:
						if (((temp / 3) >= atLeastP)) {
							BestResults++;
						} else {
							if (((((temp / 3) + 1) >= atLeastP) && ((temp / 3) >= 1))
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
								
							}
							System.out.println("Case 0"+"itr:"+i+"  surprising:"+temp);
						}
						
						break;
					case 1:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
							continue;
						}
						
						break;
					case 2:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
						} else {
							if (((temp / 3) + 2 >= atLeastP)
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
							}
							System.out.println("Case 2"+"itr:"+i+"  surprising:"+temp);
						}
						break;
					default:
						System.out.println("Error");
					}
	    			
				}// Internal for
				out.println(BestResults);
				// System.out.println(BestResults);
				System.out.println(Surprising);
				BestResults = 0;
			}// for
			in.close();
			out.close();
			fos.close();

	   }
}

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

public class CodeJamB
{

	public static void main(String[] args) throws IOException
	{
		String fileName = "B-large";
		Scanner in = new Scanner(new File(fileName + ".in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter(
				fileName + ".out")));

		// Keep track of time for efficiency
		long startTime = System.currentTimeMillis();

		// Generate all of the scores
		HashMap<Integer, ArrayList<Score>> map = new HashMap<Integer, ArrayList<Score>>();
		for (int x = 0; x <= 10; x++)
			for (int y = x; y <= x + 2 && y <= 10; y++)
				for (int z = y; z <= x + 2 && z <= 10; z++)
				{
					Score next = new Score(x, y, z);
					int total = next.total;
					ArrayList<Score> list = map.get(total);
					if (list == null)
					{
						list = new ArrayList<Score>();
						map.put(total, list);
					}
					list.add(next);
				}
		//System.out.println(map);
		//System.out.println(map.size());

		// Process each of the test cases
		int noOfCases = in.nextInt();

		for (int caseNo = 1; caseNo <= noOfCases; caseNo++)
		{

			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
		//	System.out.println("S: "+ S);
		//	System.out.println("P: "+ p);

			int overPNormal = 0;
			int overPSurprised = 0;
			for (int next = 0; next < N; next++)
			{
				int total = in.nextInt();
				int maxNormal = 0;
				int maxSurprise = 0;
				for (Score score : map.get(total))
				{
					if (score.isSurprising)
					{
						if (score.z > maxSurprise)
							maxSurprise = score.z;
					}
					else
					{
						if (score.z > maxNormal)
							maxNormal = score.z;
					}
				}
				if (maxNormal >= p)
					overPNormal++;
				else if (maxSurprise >= p)
					overPSurprised++;

			//	System.out.println(maxNormal + " " + maxSurprise);

			}
			int overP = overPNormal + Math.min(overPSurprised, S);
			System.out.println("Case #" + caseNo + ": " + overP);
			out.println("Case #" + caseNo + ": " + overP);

		}

		System.out.println("Done");
		long stopTime = System.currentTimeMillis();
		System.out.println("Time: " + (stopTime - startTime) / 1000.0);

		// Close the files
		in.close();
		out.close();
	}
}

class Score
{
	int x, y, z;

	int total;

	boolean isSurprising;

	// Assume z is always the highest score and x is the lowest
	public Score(int x, int y, int z)
	{
		this.x = x;
		this.y = y;
		this.z = z;
		total = x + y + z;
		isSurprising = (z - x == 2);
	}

	public String toString()
	{
		return "(" + x + "," + y + "," + z + ")" + (isSurprising ? "S" : "");
	}
}
