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.StringTokenizer;

public class q2
{
	public static int spl,threshold,players,output;
	public static void main(String []args) throws IOException
	{
		
		 PrintWriter pw=new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
	   BufferedReader br=new BufferedReader(new FileReader("input.txt"));
		
		int arr[]=new int[107];
		 int limit=Integer.parseInt(br.readLine());
		 String x1;
		 String word="";
		 for(int li=1;li<=limit;li++)
	   {
	   	   x1=br.readLine();
	   	  int j=0;
	   	   StringTokenizer st =new StringTokenizer(x1);
	   	   while (st.hasMoreElements()) {

              String token = st.nextElement().toString();
               arr[j]=Integer.parseInt(token);
                 j++;
           }
            
            spl=arr[1];
            threshold=arr[2];
            players=arr[0];  
	   	    output=find(arr);
	        pw.println("Case #"+li+": "+output);
	   arr=new int[107];
	   }
	    pw.close();
  }
	
	public static int find(int arr[])
	{
		int a=0,b=0,c=0;
		int op=0;	
		for(int i=3;i<(players+3);i++)
		{
		   int num=arr[i];
		   int num2=num;
		   boolean check=true;
	  	a=num/3;
	     b=a;
		c=a;
		int diff=num2-(a*3);
			
		if(diff==0)
		{   if(a>=threshold||b>=threshold||c>=threshold)
	 	      op++;
	 	else
	 	 { 	 	
	 	 	if(spl>0)
	 	 	{
	 	 	 	if((a-1)>0)
	 	      	{
	 	 	 	 	if((a-1)>=threshold||b>=threshold||(c+1)>=threshold)
	 	             {
	 	             	  op++;
	 	                   spl--;
	 	              }
	 	         }
	 	      }
	 	   }
	 	 
		 }
		
		 if(diff==1)
		 { 	 if((a+1)>=threshold||b>=threshold||c>=threshold)
	 	       {      op++;
	 	        }
	 	       
	 	       else
	 	 { 	 	
	 	 	if(spl>0)
	 	 	{
	 	 	  	 	if((a+1)>=threshold||(b-1)>=threshold||(c+1)>=threshold)
	 	             {
	 	             	  op++;
	 	                   spl--;
	 	              }
	 	         
	 	      }
	 	   } 
	 	        
	 	 }
	     if(diff==2)
	     {	 
	 	      if((a+1)>=threshold||(b+1)>=threshold||c>=threshold){
	 	  	 op++;
	 	 }
	 	 else
	 	 { 	if(spl>0)
	 	 	{
	 	 	   if((a+2)>=threshold||b>=threshold||c>=threshold)
	 	        { 
	 	          op++;
	 	           spl--;
	 	      }
	 	   }
	 	 }
	 	 
	 	 }
	 	 }
	     
	    return op;
	}
}