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();

	   }
}

/**
 * 
 * @author slerig
 *
 */

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

public class ScoreChecker {

	/**
	 * @param args
	 * @throws FileNotFoundException 
	 */
	public static void main(String[] args) throws FileNotFoundException {
		File inFile = new File("B-large.in");
		PrintWriter outFile = new PrintWriter("B-large.out");
		Scanner in = new Scanner(inFile);
		
		int cases = in.nextInt();
		for(int i = 1; i <= cases; i++)
		{
			int googlers = in.nextInt();
			int surprising = in.nextInt();
			int minScore = in.nextInt();
			int googlersWithMin = 0;
			int[][] scores = new int[googlers][3];
			
			// Determining individual scores from total scores; before
			// surprising scores are taken into account.
			for(int j = 0; j < googlers; j++)
			{
				float score = in.nextLong();
				float ftemp = score / 3;
				int temp = (int)ftemp;
				if(ftemp - temp > 0.5)
				{
					scores[j][0] = temp + 1;
					scores[j][1] = temp + 1;
					scores[j][2] = temp;
				}
				else if(ftemp - temp > .25)
				{
					scores[j][0] = temp + 1;
					scores[j][1] = temp;
					scores[j][2] = temp;
				}
				else
				{
					for(int k = 0; k < 3; k++)
					{
						scores[j][k] = temp;
					}
				}
			}
			
			// Editing for surprising scores.
			for(int j = 0; j < googlers; j++)
			{
				// Very complicated way of deciding which scores are the surprising scores.
				if(surprising > 0 && scores[j][0] != 0 && scores[j][1] != 0 && scores[j][2] != 0)
					if(scores[j][0] != 10 && (scores[j][0] >= minScore-1 && scores[j][0] < minScore))
						if((scores[j][0] == scores[j][1]))
						{
							scores[j][0]++;
							scores[j][1]--;
							surprising--;
						}
			}
			
			// Checking for googlers with min score.
			for(int j = 0; j < googlers; j++)
			{
				if(scores[j][0] >= minScore)
					googlersWithMin++;
			}
			
			outFile.println("Case #" + i + ": " + googlersWithMin);
			
			/* Debugging code
			outFile.println();
			for(int j = 0; j < googlers; j++)
			{
				for(int k = 0; k < 3; k++)
				{
					outFile.print(scores[j][k] + " ");
				}
				outFile.println();
			}
			*/
		}
		outFile.close();
	}

}
