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.util.Scanner;
class Another{
	private int total, modulo;
	public Another(int a){
		total = a;
		modulo = a % 3;
	}
	public int surprisingScore(){
		if (total < 3){
			return total;
		} else
		if (modulo == 2){
			return (total/3) + 2;
		} else {
			return (total/3) + 1;
		}
	}
	public int notSurprisingScore(){
		if (total < 2){
			return total;
		} else if (total == 2){
			return 1;
		} else
		if (modulo == 0){
			return (total/3);
		} else {
			return (total/3) + 1;
		}
	}
}
class DanceResult{
	private int[] myArray;
	private int arraySize, minimum, numberOfSurprises;
	private int[][] result;
	public DanceResult(int[] anArray, int min, int surprises){
		myArray = anArray;
		minimum = min;
		numberOfSurprises = surprises;
		arraySize = myArray.length;
		result = new int[arraySize][2];
	}
	public void generateScores(){
		for (int i = 0; i < arraySize; i++){
			int value = myArray[i];
			Another checkScore = new Another(value);
			int surprising = checkScore.surprisingScore();
			int notSurprising = checkScore.notSurprisingScore();
			result[i][0] = surprising;
			result[i][1] = notSurprising;
		}
		return;
	}
	public int solve(){
		int countSurprise = 0;
		int countNotSurprise = 0;
		for (int i = 0; i < arraySize; i++){
			if (result[i][0] >= minimum){
				countSurprise++;
			}
			if (result[i][1] >= minimum){
				countNotSurprise++;
			}
		}
		int difference = countSurprise - countNotSurprise;
		if (difference >= numberOfSurprises){
			return countNotSurprise + numberOfSurprises;
		} else
			return countSurprise;
	}
}
public class Dance {

	public static void main(String[] args) {
		int numberOfGooglers, numberOfSurprising, leastScore, numberOfCases, currentCase;
		int[] scores;
		DanceResult myResult;
		Scanner myScanner = new Scanner(System.in);
		numberOfCases = myScanner.nextInt();
		currentCase = 1;
		for (int j = 0; j < numberOfCases; j++){
			numberOfGooglers = myScanner.nextInt();
			numberOfSurprising = myScanner.nextInt();
			leastScore = myScanner.nextInt();
			scores = new int[numberOfGooglers];
			for(int i = 0; i < numberOfGooglers; i++){
				scores[i] = myScanner.nextInt();
			}
			myResult = new DanceResult(scores, leastScore, numberOfSurprising);
			myResult.generateScores();
			System.out.println("Case #" + currentCase + ": " + myResult.solve());
			currentCase++;
		}

		
	}

}
