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

public class DancingWithGooglers {

    public static void main(String[] args) {
        
       try {
            BufferedReader lector = new BufferedReader(new FileReader(args[0]));
            int iterations = Integer.parseInt(lector.readLine());


            int numOfGooglers = 0;
            int surprisingScores = 0;
            int requestedPunctuation = 0;
            int googlersWithPunct= 0;
            int googlerPunctuation = 0;
            int mediumPunctuation = 0;
            int restPuntuaction = 0;
            
            String linea = null;
            String[] values = null;

            for (int idx=1; idx <= iterations; idx++) {
                //Obtenemos la lÃ­nea actual o caso a trata
                linea = lector.readLine();

                //Obtenemos los valores de la lÃ­nea actual
                values = linea.split("\\s");

                //Obtenemos el nÃºmero de bailadores
                numOfGooglers = Integer.parseInt(values[0]);
                //Obtenemos el nÃºmero de puntuaciones sorprendentes
                surprisingScores = Integer.parseInt(values[1]);
                //Obtenemos la puntuaciÃ³n mÃ¡xima
                requestedPunctuation = Integer.parseInt(values[2]);
                    
                //Para este caso ponemos los resultados a 0
                googlersWithPunct = 0;
                
                //Hacemos el tratamiento especÃ­fico para cada bailador
                for (int i=0; i<numOfGooglers ; i++)
                {
                    //Obtenemos la puntuaciÃ³n actual del concursante
                    googlerPunctuation = Integer.parseInt(values[i+3]);
                    
                    if (googlerPunctuation >= requestedPunctuation) {
                        //Determinamos si el concursante puede haber obtenido la nota mÃ­nima
                        mediumPunctuation = googlerPunctuation / 3;
                        restPuntuaction = googlerPunctuation % 3;

                        //Si la media de puntuaciÃ³n es igual o mayor a la puntuaciÃ³n mÃ¡xima ya sabemos que ese concursante lo cumple
                        if (mediumPunctuation >= requestedPunctuation) {
                            googlersWithPunct++;
                        }
                        else {

                            if (surprisingScores == 0) {
                                //Si no puede haber resultados sorprendentes

                                if (restPuntuaction != 0 && (mediumPunctuation + 1 == requestedPunctuation)) {
                                    googlersWithPunct++;
                                }
                            }
                            else {
                                //Si aun puede haber sorprendentes
                                if (restPuntuaction == 1 && (mediumPunctuation + 1 == requestedPunctuation)) {
                                    googlersWithPunct++;
                                }
                                else if (restPuntuaction == 2 && (mediumPunctuation + 2 >= requestedPunctuation)) {
                                    googlersWithPunct++;
                                    surprisingScores--;
                                }
                                else if (restPuntuaction == 0 && (mediumPunctuation + 1 >= requestedPunctuation)) {
                                    googlersWithPunct++;
                                    surprisingScores--;
                                }
                            }
                        }
                    }
                }

                System.out.printf("Case #%d: %s\n", idx, googlersWithPunct);
                
            }
        }
        catch (FileNotFoundException ex) {
            System.out.println("Error:: Juego de pruebas no pasado por lÃ­nea de comandos");
        }
        catch (IOException ex) {
            System.out.println("Error:: Se ha producido un error en el procesamiento del archivo");
        }
    }

}
