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

class DancingWithTheGooglers {

	public static void main(String[] args) throws FileNotFoundException {
	
		File input = new File("/home/michael/sandbox/codejam2012/B-large.in.txt");
		File output = new File("/home/michael/sandbox/codejam2012/B-large.out.txt");
		PrintWriter fout = new PrintWriter(output);
		Scanner s = new Scanner(input);
		int tests = s.nextInt();
		for( int t = 0; t < tests; t++ ) {
			int dancers = s.nextInt();
			int surprises = s.nextInt();
			int threshold = s.nextInt();
			int definites = 0;
			int potential_surprises = 0;
			for( int d = 0; d < dancers; d++ ) {
				int score = s.nextInt();
				int[] analysis = new int[2];
				process(score,analysis);
				if( analysis[0] >= threshold ) {
					if( analysis[0] == threshold && analysis[1] == 1 ) {
						potential_surprises++;
					} else {
						definites++;
					}
				}
			}
			fout.println( "Case #" + (t+1) + ": " +
								(definites + Math.min(surprises,potential_surprises)) );
		}
		fout.close();
	}
		
	//analysis[0] is the highest achievable individual score given
	//the total score; analysis[1] is 1 if that score would be
	//surprising and 0 otherwise
	private static void process(int score, int[] analysis) {
		analysis[1] = 0;
		int avg_score = score / 3;
		if( score < 2 ) { // special cases, since -1 is not a legal score
			analysis[0] = score;
		} else if( score > 28 ) { // also special cases; 11 is also illegal
			analysis[0] = 10;
		} else if( score % 3 == 0 ) {
			analysis[0] = avg_score + 1;
			analysis[1] = 1;
		} else if( score % 3 == 1 ) {
			analysis[0] = avg_score + 1;
			// not surprising
		} else if( score % 3 == 2 ) {
			analysis[0] = avg_score + 2;
			analysis[1] = 1;
		}
	}
}
