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.
 */

/**
 *
 * @author Usuario
 */
import java.io.*;
import java.util.*;
public class DanceWithGooglers {
    public static void main (String[] args)
    {
        BufferedReader br = null;
        PrintStream ps = null;
       
        try
        {
            int t;
            int n;
            int s;
            int p;
           
            int count;
            int countsurprisingoblig;
            int countimp;
           
            ArrayList<Integer> scores;

            String line;
            StringTokenizer st;
                       
            br = new BufferedReader (new FileReader("B.in"));
            ps = new PrintStream (new FileOutputStream ("B-samll1.out"));
                       
            line = br.readLine ();
            t = Integer.parseInt (line);
           
            for (int testCase = 0; testCase < t; testCase++)
            {
                count = 0;
                countsurprisingoblig = 0;
                countimp = 0;
               
                line = br.readLine ();
                st = new StringTokenizer (line);
               
                n = Integer.parseInt (st.nextToken ());
                s = Integer.parseInt (st.nextToken ());
                p = Integer.parseInt (st.nextToken ());

                scores = new ArrayList ();
               
                for (int scoreInputIndex = 0; scoreInputIndex < n; scoreInputIndex++)
                {
                    scores.add (Integer.parseInt (st.nextToken ()));
                }
               
                for (int score : scores)
                {
                    int diff = (int) Math.abs (score - (3*p));
                   
                    if ((score < (3 * p)) && ((diff == 3 || diff == 4)) && (score != 0) && (p > 0))
                    {
                        countsurprisingoblig++;
                    }
                    else if (((score < (3 * p)) && (diff > 4)) || ((score == 0) && (p > 0)))
                    {
                        countimp++;
                    }
                }
               
                count = scores.size () - countimp - countsurprisingoblig;
               
                if (countsurprisingoblig > s)
                {
                    count += s;
                }
                else
                {
                    count += countsurprisingoblig;
                }
               
//                System.out.println (count);
//                System.out.println (n + " " + s + " " + p + " " + scores.toString ());
//                System.out.println ("Case #" + (testCase + 1) + ": " + s);               
                System.out.println("Case #" + (testCase + 1) + ": " + count);
                ps.println ("Case #" + (testCase + 1) + ": " + count);
            }
                       

//            ps.println ("test1 test1 test1");
           
//            System.out.println ("Hola Mundo!!!");           
        }
        catch (IOException ioe)
        {
            ioe.printStackTrace ();
        }
        catch (NumberFormatException nfe)
        {
            nfe.printStackTrace ();
        }
        finally
        {
            if (ps != null)
            {
                ps.close ();
            }
            if (br != null)
            {
                try
                {
                    br.close ();                   
                }
                catch (IOException ioe)
                {
                    ioe.printStackTrace ();
                }
            }
        }
    }    
}
