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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Main1 {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        Find f=new Find();
        f.find();
    }

}

class Find
{

int size;
int start=1;
     
    public void find()
    {
            try {

                File inputFile = new File("input.txt");
                File tempFile = new File("out.txt");

            BufferedReader reader = new BufferedReader(new FileReader(inputFile));
            BufferedWriter writer = new BufferedWriter(new FileWriter(tempFile));

                FileOutputStream fos=new FileOutputStream(tempFile);

            String currentLine;
            int size;
            int tno,sur,max;
            int count=0,no,no3;

            while((currentLine = reader.readLine()) != null) {

                    count=0;
                    String[] sArray = currentLine.split(" ");

                    if(sArray.length<=1)
                    {
                        size=Integer.parseInt(sArray[0]);
                        System.out.println("size="+size);
                        writer.write(currentLine);
                    }
                    else
                    {
                        tno=Integer.parseInt(sArray[0]);
                        sur=Integer.parseInt(sArray[1]);
                        max=Integer.parseInt(sArray[2]);
                        no3=max*3;

                        System.out.print("tno"+tno+"sur"+sur+"max"+max);
                      //  writer.write("tno"+tno+"sur"+sur+"max"+max);
                        for(int i=3;i<sArray.length;i++)
                        {
                            no=Integer.parseInt(sArray[i]);
                            if(no==0 )
                            {
                                
                            }
                            else if(no >= no3 - 2)
                            {
                                count++;
                            }
                            else if(no==no3-3 || no==no3-4)
                            {
                                if(sur>0)
                                {
                                    count++;
                                }
                                sur--;
                            }

                        }
                        String s1="Case #"+ start++ +": "+count+"\n";
                        System.out.println(s1);
                        byte b1[]=s1.getBytes();
                        fos.write(b1);
                        
                        
                    }
                    
                }
            
        } catch (Exception ex) {
            System.err.println("FileStreamsTest: " + ex);
        } 
    }
}
