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

import java.util.*;
import java.io.*;
/**
 * Google Code Jam 2012
 * Problem B. Dancing With the Googlers
 * @author STEVEN GANTENG
 * step.v4n@gmail.com
 */
public class DancingWithTheGooglers {
    
    public static int cases;
    public static String result="";
    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
        try {
            FileInputStream fin = new FileInputStream("B-large-in.txt");
            FileOutputStream fout = new FileOutputStream("B-large.out");
            Scanner source = new Scanner(fin);
            cases = source.nextInt();
            Double t[] = new Double[100];
            int count=0;
            int a=1;
            for (int j=0;j<cases;j++)
            {
                
                int N = source.nextInt();
                int S = source.nextInt();
                double p = source.nextDouble();//System.out.println(p)
                Double tmp[] = new Double[100];                
                for (int i=0;i<N;i++)
                {
                    t[i]=source.nextDouble();
                    //System.out.print(t[i]+" ");
                    tmp[i] = t[i]/3;                                                                 
                }
                for (int k=0;k<N;k++)
                {                    
                    if (tmp[k]>=p)
                    {
                        count++;
                    }
                    else if (tmp[k]==0)
                    {
                        if (p>0)
                        {
                            
                        }
                    }
                    else if ((tmp[k]-p)>-0.7)
                    {
                        count++;
                    }
                    else if ((tmp[k]-p)>-1.34)
                    {
                        if (S==0)
                        {
                            
                        }
                        else if (S!=0)
                        {
                            count++;
                            S-=1;
                        }
                    }
                        
                    //System.out.print(tmp[k]+" ");
                }
                System.out.println();                
                result += "Case #"+a+": "+count+"\n";    
                a++;
                fout.write(result.getBytes());
                result="";
                count=0;
                System.out.println();                
                
            }
        } catch (IOException e)
        {
            
        }
        //System.out.print(0/3);
    }
}
