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.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class Googlers {

	public static void main(String[] args) throws FileNotFoundException {
		new Googlers().doProcessing(new File("D:\\codejam\\B\\small.txt"));
	}

	public void doProcessing(File inputFile) throws FileNotFoundException {
		Scanner scanner = new Scanner(inputFile).useDelimiter("\n");
		if (scanner != null) {
			int totalCases = Integer.parseInt(scanner.next().trim());
			int k = 1 ;
			if (totalCases > 0) {
				while (scanner.hasNext()) {
					String[] rowValues = scanner.next().trim().split(" ");

					int totalGooglers = Integer.parseInt(rowValues[0]);
					// System.out.println("Total Googlers : " + totalGooglers);
					int totalSuprisingCases = Integer.parseInt(rowValues[1]);
					// System.out.println("Total Surprising Cases : " +
					// totalSuprisingCases);

					int averageScore = Integer.parseInt(rowValues[2]);
					// System.out.println("Total Success Cases : " +
					// averageScore);
					// System.out.println("Total Length : " + rowValues.length);

					int[] totalMarks = new int[totalGooglers];
					int j = 0;
					for (int i = 3; i < rowValues.length; i++) {
						totalMarks[j] = Integer.parseInt(rowValues[i].trim());
						// System.out.println("Value Put : " + totalMarks[j]);
						j++;
					}
					int successCase = getSuccessCase(totalGooglers,
							averageScore, totalSuprisingCases, totalMarks);
					System.out.println("Case #" + k++ + ": " + successCase);
				}

			}
		}
		scanner.close();
	}

	public boolean doNormalCase(int totalScore, int averageScore) {
		boolean success = false;
		int X3value = averageScore * 3;
		if (totalScore >= X3value) {
			success = true;
		} else if ((totalScore >= X3value - 1) || (totalScore >= X3value + 1)) {
			success = true;
		} else if ((totalScore >= X3value - 2) || (totalScore >= X3value + 2)) {
			success = true;
		} else {
			success = false;
		}
		return success;
	}

	public boolean doSurprisingCase(int totalScore, int averageScore) {
		boolean success = false;
		int X3value = averageScore * 3;
		// System.out.println("Total Score : " + totalScore);
		// System.out.println("Average Score : " + X3value);
		if (((totalScore >= X3value - 3) || (totalScore >= X3value + 3))
				&& totalScore > averageScore) {
			success = true;
		} else if (((totalScore >= X3value - 4) || (totalScore >= X3value + 4))
				&& totalScore > averageScore) {
			success = true;
		} else {
			success = false;
		}
		return success;
	}

	public int getSuccessCase(int totalCses, int averageScore,
			int surprisingCase, int[] caseValues) {
		int totalSuccess = 0;
		for (int i = 0; i < totalCses; i++) {
			// System.out.println("----------------------Value Put : " +
			// totalCses);
			boolean normalCaseSuccess = doNormalCase(caseValues[i],
					averageScore);
			if (!normalCaseSuccess) {
				if (surprisingCase > 0) {
					boolean surprisingCaseSuccess = doSurprisingCase(
							caseValues[i], averageScore);
					if (surprisingCaseSuccess) {
						// System.out.println("Surprising Success..." +
						// caseValues[i]);
						totalSuccess++;
						surprisingCase--;
					}
				}
			} else {
				totalSuccess++;
			}
		}
		return totalSuccess;
	}

}
