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();

	   }
}

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

import java.io.FileOutputStream;
import java.util.Arrays;
import java.util.Scanner;

/**
 *
 * @author youssefgamil
 */
public class Gcj12_qB {

    /**
     * @param args the command line arguments
     */
    public static int scores[]=new int[40];//10+10+10=30
    
    public static void main(String[] args) throws Exception {
        Scanner sc=new Scanner(System.in);
        FileOutputStream out=new FileOutputStream("out.txt");
        int tc,i,j,k,T=sc.nextInt();
        
        int N,S,p,res;
        
        for(tc=1;tc<=T;tc++)
        {
            N=sc.nextInt();
            S=sc.nextInt();
            p=sc.nextInt();
            Arrays.fill(scores,0);
            res=0;
            
            for(i=0;i<N;i++)
                scores[sc.nextInt()]++;
            
            for(int h=0;h<N;h++)
            for(i=0;i<11;i++)
                for(j=i;j<11;j++)
                    for(k=j;k<11;k++)
                        if(scores[i+j+k]>0)
                        {
                            if(Math.abs(k-j)>2 || Math.abs(k-i)>2 || Math.abs(i-j)>2)
                                continue;
                            
                            
                            
                            if(Math.max(i,Math.max(j,k))>=p)
                            {
                                if(Math.abs(i-j)==2 || Math.abs(k-j)==2 || Math.abs(k-i)==2)
                                {
                                        if(S>0)
                                        {
                                            S--;
                                            res++;
                                            scores[i+j+k]--;
                                        }
                                }
                                else
                                {
//                                    res++;
//                                    scores[i+j+k]--;
                                }
                            }
                          //  System.out.println("Posible sol="+i+","+j+","+k+"\t\tS="+S);
                        }
            
            for(int h=0;h<N;h++)
            for(i=0;i<11;i++)
                for(j=i;j<11;j++)
                    for(k=j;k<11;k++)
                        if(scores[i+j+k]>0)
                        {
                            if(Math.abs(k-j)>2 || Math.abs(k-i)>2 || Math.abs(i-j)>2)
                                continue;
                            
                            
                            
                            if(Math.max(i,Math.max(j,k))>=p)
                            {
                                if(Math.abs(i-j)==2 || Math.abs(k-j)==2 || Math.abs(k-i)==2)
                                {
                                        if(S>0)
                                        {
//                                            S--;
//                                            res++;
//                                            scores[i+j+k]--;
                                        }
                                }
                                else
                                {
                                    res++;
                                    scores[i+j+k]--;
                                }
                            }
                          //  System.out.println("Posible sol="+i+","+j+","+k+"\t\tS="+S);
                        }
            
            
            res=Math.min(res,N);
            System.out.print(("Case #"+tc+": "+res+"\n"));
            out.write(("Case #"+tc+": "+res+"\n").getBytes());
        }
        out.close();
        // TODO code application logic here
    }
}
