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.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;


public class Main {

    
    public static void main(String[] args) throws IOException {

        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        int tc=Integer.parseInt(br.readLine());
        for(int j=0;j<tc;j++)
        {
            String str=br.readLine();
            StringTokenizer st=new StringTokenizer(str);
            int n=Integer.parseInt(st.nextToken());
            int s=Integer.parseInt(st.nextToken());
            int p=Integer.parseInt(st.nextToken());
            int GS[]=new int[n];
            int GT[]=new int[n];
            int cnt=0;
            for(int i=0;i<n;i++)
            {
                GS[i]=Integer.parseInt(st.nextToken());
                GT[i]=GS[i]/3;

            }

            for(int i=0;i<n;i++)
            {
                if (GS[i]==0&&p!=0)
                    continue;
                
                if(GS[i]-(GT[i]*3)==2)
                {
                    
                    GT[i]=GT[i]+1;
                    if(GT[i]>=p)
                    {
                        cnt++;
                        continue;
                    }
                    if(s>0)
                    {
                        if((GT[i]+1)==p)
                        {
                            GT[i]=GT[i]+1;
                            cnt++;
                            s--;
                            
                        }
                    }




                }


            }

            for(int i=0;i<n;i++)
            {
                if (GS[i]==0&&p!=0)
                    continue;
                if(GS[i]-(GT[i]*3)==1)
                {
                    GT[i]=GT[i]+1;
                    if(GT[i]>=p)
                    cnt++;


                }


            }

            for(int i=0;i<n;i++)
            {
                if (GS[i]==0&&p!=0)
                    continue;
                if(GS[i]-(GT[i]*3)==0)
                {
                    if(GT[i]>=p)
                    {
                        cnt++;
                        continue;
                    }
                    else if(s>0)
                    {
                    GT[i] = GT[i] + 1;
                    if(GT[i]>=p)
                        {
                        s--;
                        cnt++;
                        }

                    }

                }


            }

       int x=j+1;
       System.out.println("Case #"+x+": "+cnt);

        }
    }
    

}

