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.Arrays;
import java.util.Comparator;

public class Qualify {

	public static void main(String[] args) {
		try {
			BufferedReader reader = new BufferedReader(new FileReader(new File("B-small-attempt3.in")));
			int cases = Integer.parseInt(reader.readLine());
			for (int d = 0; d < cases; d++) {

				// parse
				String line = reader.readLine();
				String[] spLine = line.split(" ");
				int googs = Integer.parseInt(spLine[0]);
				int surprises = Integer.parseInt(spLine[1]);
				int prize = Integer.parseInt(spLine[2]);
				Googler[] googArr = new Googler[googs];

				// find the solutions for each googler
				for (int r = 0; r < googs; r++) {
					googArr[r] = new Googler();
					Integer total = Integer.parseInt(spLine[(r + 3)]);
					googArr[r].poss(total, prize);

				}

				// sort the array based on how many possibilities it has
				Arrays.sort(googArr, new Comparator<Googler>() {
					@Override
					public int compare(Googler o1, Googler o2) {
						// TODO Auto-generated method stub
						return new Integer(o1.trueCounter)
								.compareTo(o2.trueCounter);
					}
				});

				int surCounter = 0;
				int winCounter = 0;
				/*
				 * boolean prizeSurprise = false; boolean prizeNoSurprise =
				 * false; boolean failSurprise = false; boolean failNoSurprise =
				 * false;
				 */
				for (int i = 0; i < googs; i++) {
					if (googArr[i].trueCounter == 1) {
						if (googArr[i].prizeSurprise == true) {
							winCounter++;
							surCounter++;
							googArr[i].used = true;
						} else if (googArr[i].prizeNoSurprise == true) {
							winCounter++;
							googArr[i].used = true;
						} else if (googArr[i].failSurprise == true) {
							surCounter++;
							googArr[i].used = true;
						} else {
							// nothing to do with this
							googArr[i].used = true;
						}
					}
				}

				for (int i = 0; i < googs && surCounter < surprises; i++) {
					if (googArr[i].used == false) {
						if (googArr[i].prizeSurprise == true && googArr[i].prizeNoSurprise == false) {
							winCounter++;
							surCounter++;
							googArr[i].used = true;
							break;
						}
					}
				}
				
				for (int i = 0; i < googs && surCounter < surprises; i++) {
					if (googArr[i].used == false) {
						if (googArr[i].prizeSurprise == true) {
							winCounter++;
							surCounter++;
							googArr[i].used = true;
							break;
						}
					}
				}

				for (int i = 0; i < googs && surCounter < surprises; i++) {
					if (googArr[i].used == false) {
						if (googArr[i].failSurprise == true) {
							surCounter++;
							googArr[i].used = true;
						}
					}
				}

				for (int i = 0; i < googs; i++) {
					if (googArr[i].used == false) {
						if (googArr[i].prizeNoSurprise) {
							winCounter++;
							googArr[i].used = true;
						}
					}
				}

				System.out.println("Case #" + (d+1) + ": " + winCounter);

			}

		} catch (Exception ex) {
			ex.printStackTrace();
		}

	}

}
