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 codejam;

import java.io.*;
import java.util.logging.Level;
import java.util.logging.Logger;

/**
 *
 * @author user
 */
public class CodeJam {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        FileReader fin = null;
        FileWriter fout = null;
        try {
            fin = new FileReader("input.txt");
            fout = new FileWriter("Output.txt");
            BufferedWriter out = new BufferedWriter(fout);
            BufferedReader in = new BufferedReader(fin);
            int t;
            t = Integer.parseInt(in.readLine());
            int j = 0,N,S,P;
            String[] k;
            while (t > j) {
                k = in.readLine().split(" ");
                N = Integer.parseInt(k[0]);
                S = Integer.parseInt(k[1]);
                P = Integer.parseInt(k[2]);
                int arr;
                int count = 0;
                int f,mod,ml,temp;
                for (int i = 0; i < N; i++) {
                    arr = Integer.parseInt(k[i + 3]);
                    f = arr / 3;
                    mod = arr%3;
                    if (f>= P) {
                        count++;
                    }
                    else if(f == P-1)
                    {
                        if(mod >= 1)
                        {
                            count++;
                        }
                        else
                        {
                          if(f != 0 && S > 0)
                          {
                              count++;
                              S--;
                          }
                        }
                    }
                    else if(f == P-2&& S > 0)
                    {
                        if(mod >= 2)
                        {
                            count++;
                            S--;
                        }
                    }
//                    if(P == 0)
//                    {
//                        count++;
//                        continue;
//                    }
//                    if(arr == 0) {
//                        continue;
//                    }
//                    f = arr / P;
//                    mod = arr%P;
//                    if (f >= 3) {
//                        count ++;
//                    }
//                    else if(f == 1)
//                    {
//                        continue;
//                    }
//                    else
//                    {
//                        ml = P;
//                        temp = (ml - mod)/2;
//                        ml -= temp;
//                        mod += temp;
//                        if (P - mod > 2) {
//                            continue;
//                        }
//                        else if (P - mod == 2)
//                        {
//                            if(S > 0)
//                            {
//                                S --;
//                                count ++;
//                            }
//                        }
//                        else
//                        {
//                            count ++;
//                        }
//                    }
                }
                out.write("Case #" + (j + 1) + ": " + count + "\n");
                out.flush();
                j ++;
            }
        } catch (IOException ex) {
            Logger.getLogger(CodeJam.class.getName()).log(Level.SEVERE, null, ex);
        } finally {
            try {
                fin.close();
                fout.close();
            } catch (IOException ex) {
                Logger.getLogger(CodeJam.class.getName()).log(Level.SEVERE, null, ex);
            }
        }
            
    }
}
