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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author home
 */
public class DancingWithGooglers {
    public static void main(String args[])throws IOException{
     FileReader reader = new FileReader("D:\\NetBeansProjects\\DBInteractionWithWS\\src\\java\\B-large.in");
		BufferedReader br = new BufferedReader(reader);
		File file = new File("d:\\rloutput.txt");
		FileWriter fw = new FileWriter(file);
		int count = Integer.parseInt(br.readLine());
		for(int s=0;s<count;s++){
                    List list = new ArrayList();
                    String line = br.readLine();
                    //System.out.println(line);
                    int num = Integer.parseInt(line.split(" ")[0]);
                    int triplets =Integer.parseInt(line.split(" ")[1]);
                    int pendingtriplets = triplets;
                    int highest=Integer.parseInt(line.split(" ")[2]);
                    String splits[]=line.split(" ");
                    int resultCount=0;
                    int surpriseCount=0;
                    for(int i=3;i<num+3;i++){
                        
                     
                        int number =Integer.parseInt(splits[i]);
                        Bean be = new Bean();
                        if(number%3==0){
                        
                            
                            be.first =number/3;
                            be.second=number/3;
                            be.third = number/3;
                            if(be.first>=highest){
                                resultCount++;
                            }
                            
                        }else if(number%3==1){
                            
                            be.first= number/3;
                            be.second = number/3;
                            be.third = (number/3)+1;
                            if(be.third>=highest){
                                    resultCount++;
                                    
                                }
                        
                        }else if(number%3==2){
                            if((number/3)==9){
                                be.first=number/3;
                                be.second=be.first+1;
                                be.third=be.first+1;
                                if(be.second>=highest){
                                    resultCount++;
                                  
                                }
                            }else if(pendingtriplets==0){
                                be.first=number/3;
                                be.second=be.first+1;
                                be.third=be.first+1;
                                if(be.second>=highest){
                                    resultCount++;
                                  
                                }
                            }
                            else{
                                be.first=number/3;
                                be.second=(number/3)+2;
                                be.third=number/3;

                                if(be.second>=highest){
                                    resultCount++;
                                    surpriseCount++;
                                    pendingtriplets--;
                                }
                            }
                        }
                    list.add(be);
                    
                    
                    
                    
                    }
                    //System.out.println("triplets :"+triplets+", surprise "+surpriseCount);
                    
                    if(triplets>surpriseCount){
                         for(int cc=0;cc<list.size();cc++){
                             if(triplets>surpriseCount){
                                 //System.out.println("triplets :"+triplets+", surprise "+surpriseCount);
                             Bean be1 = (Bean)list.get(cc);
                           //  System.out.println(be1.first+","+be1.second+","+be1.third);
                             if(((be1.first==be1.second)&&(be1.second==be1.third))&&be1.first!=10&&be1.first!=0){
                             
                                 if((be1.first+1)>=highest){
                                 
                                     be1.first=be1.first-1;
                                     
                                     be1.third =be1.third+1;
                                     if(!(be1.second>=highest))
                                     resultCount++;
                                     surpriseCount++;
                                    
                                 }else if((be1.first-1)>=highest){
                                     be1.first=be1.first-1;
                                     be1.third =be1.third+1;
                                     if(!(be1.second>=highest))
                                     resultCount++;
                                     surpriseCount++;
                                    
                                 }
                             }
                             
                          //   list.add(cc,be1);
                         }
                         }
                    }
                    System.out.println("Case #"+(s+1)+": "+resultCount);
            }
        }
}
class Bean{
    int first;
    int second;
    int third;
}