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

	   }
}

/*
 * Gabriel Shaw
 * 4/13/12
 */
import java.io.File;
import java.io.PrintWriter;
import java.io.IOException;
import java.util.Scanner;
public class DancingWithTheGooglers 
{
    public static void main(String[] args) throws IOException
    {
        File file = new File("B-large.in");
        PrintWriter outfile = new PrintWriter("B-large.out");
        Scanner infile = new Scanner(file);
        int numberOfCases;
        int numberOfGooglers;
        int desiredScore;
        int numberOfSuprisingCases;
        int numberOfGoodScores;
        numberOfCases = infile.nextInt();
        infile.nextLine();
        
        for(int i=0 ; i<numberOfCases ; i++)
        {
            numberOfGooglers = infile.nextInt();
            numberOfSuprisingCases = infile.nextInt();
            desiredScore = infile.nextInt();
            numberOfGoodScores = 0;
            for(int j=0 ; j<numberOfGooglers ; j++)
            {
                int totalScore = infile.nextInt();
                if(desiredScore <= 1)
                {
                    if(desiredScore == 1)
                    {
                        if(totalScore - desiredScore >= 0)
                        {
                            numberOfGoodScores++;
                        }//end of if(totalScore - desiredScore >= 0)
                    }//end of if(desiredScore == 1)
                    if(desiredScore == 0)
                    {
                        if(totalScore >= 0)
                        {
                            numberOfGoodScores++;
                        }
                    }
                }
                if(!(desiredScore <= 1) && (totalScore - desiredScore - (desiredScore - 1) - (desiredScore - 1)) >= 0)
                {
                    numberOfGoodScores++;
                }else
                {
                    if(!(desiredScore <= 1) && (numberOfSuprisingCases > 0) && (totalScore -desiredScore - (desiredScore - 2) - (desiredScore - 2)) >= 0)
                    {
                        numberOfGoodScores++;
                        numberOfSuprisingCases--;
                    }//end of if((numberOfSuprisingCases > 0) && (totalScore -desiredScore - 2*(desiredScore - 2)) >= 0)
                }//end of else
            }//end of for(int j=0 ; j<numberOfGooglers ; j++)
            outfile.println("Case #" +(i+1) +": " +numberOfGoodScores);
            if(infile.hasNext())
            {
                infile.nextLine();
            }
        }//end of for(int i=0 ; i<numberOfCases ; i++)
        outfile.close();
    }//end of public static void main(String[] args) throws IOException
}//end of public class DancingWithTheGooglers 
