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.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.StringTokenizer;


public class googleDancers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		ArrayList<Integer> lstInt = new ArrayList<Integer>();
		boolean error_ni = false;
		try{
			 FileReader fr=new FileReader("B-large.in"); 
		
			 BufferedReader  br = new BufferedReader (fr);
		     int numCases = Integer.parseInt(br.readLine());
		     BufferedWriter bw = new BufferedWriter(new FileWriter(new File("solution.txt")));
		     int i;
		     

		     for(i=1; i<=numCases; i++ ){
		    	 String linea = new String(br.readLine());
		    	 StringTokenizer palabraSeparation = new StringTokenizer(linea);
		    	 lstInt.clear();
		    	 int N = Integer.parseInt(palabraSeparation.nextToken());
		    	 int S = Integer.parseInt(palabraSeparation.nextToken());
		    	 int p = Integer.parseInt(palabraSeparation.nextToken());
		    	 int solution = 0;
		    	 int surprising = 0;
		    	 while(palabraSeparation.hasMoreTokens() != false){
		    		 int num_i = Integer.parseInt(palabraSeparation.nextToken());
		    		 lstInt.add(num_i);
		    		 /*if (num_i > 30)
		    			 error_ni = true;*/
		    	 }
		    
		    	
		    
		    	 if ((S>=0  && S <= N) && (p>= 0 && p <= 10) && error_ni == false){
		    		 if (p==0){
		    			 solution = lstInt.size();
		    		
		    		 }
		    		 else
				    		 for (int j=0; j<lstInt.size(); j++){ 
				    			  
				    			 if (p == 1  ){
				    				 if (lstInt.get(j)>0) solution++;
				    			 }	  
				    			 else if (p*3 <= lstInt.get(j) && lstInt.get(j)!=0 ){
				    				 solution++;
				    			 }
				    			 else if(p*3-2 <= lstInt.get(j) && p>=1 && lstInt.get(j)!=0 ){
				    				 solution++;
				    			 }
				    			 else if(p*3-4 <= lstInt.get(j) && lstInt.get(j) >= 2 && lstInt.get(j)<=28){
				    				 surprising++;
				    			 }
				    			 	 
				    		 }
				    		 if(S >= surprising)
			    				 solution +=surprising;
					    	 else if(S < surprising )
					    		 solution +=S;
				    	 }
				    	 
				    	 
				    	 //System.out.println("Case #" + i+": "+solution);
				    	bw.write("Case #" + i+": "+solution);
				        bw.newLine();
				         
				     }
		     
		 bw.close();
		}catch (Exception e){//Catch exception if any
		    	  System.err.println("Error: " + e.getMessage());
		}
			  
		


	}

}
