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

	   }
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

public class DancingGooglers
{
    public int googlers( int surprise, int mincount, int[] scores )
    {
        int counter = 0;
        for( int i = 0; i < scores.length; i++ )
        {
            int s = scores[i] % 3;
            int base = scores[i] / 3;
            if( s == 0 )
            {
                if( base >= mincount )
                {
                    counter++;
                }
                else
                {
                    if( surprise > 0 && base > 0 && base + 1 >= mincount )
                    {
                        counter++;
                        surprise--;
                    }
                }
            }
            else if( s == 1 )
            {
                if(base >= mincount || base +1 >= mincount)
                {
                    counter++;
                }
                else
                {
                    if(surprise > 0 && base +1 >= mincount)
                    {
                        counter++;
                        surprise--;
                    }
                }    
                
            }
            else if( s == 2 )
            {
                if(base >= mincount || base +1 >= mincount)
                {
                    counter++;
                }
                else
                {
                    if(surprise > 0 && base +2 >= mincount)
                    {
                        counter++;
                        surprise--;
                    }
                }    
                
            }
        }
        return counter;
    }

    public static void main( String[] args )
    {
        DancingGooglers dg = new DancingGooglers();

        try
        {
            FileWriter fw = new FileWriter( "output.out" );
            BufferedWriter out = new BufferedWriter( fw );

            FileReader fr = new FileReader( "in.in" );
            BufferedReader br = new BufferedReader( fr );
            String size = br.readLine();

            String temp = "";
            int k = 0;
            while( ( temp = br.readLine() ) != null )
            {                
                String[] split = temp.trim().split( " " );
                int googlercount = Integer.parseInt( split[0] );
                int surprise = Integer.parseInt( split[1] );
                int mincount = Integer.parseInt( split[2] );
                int[] scores = new int[googlercount];
                for(int i = 0;i<googlercount;i++)
                {
                    scores[i] = Integer.parseInt( split[i + 3] );
                }
                out.write( "Case #" + ( ++k ) + ": " + dg.googlers( surprise, mincount, scores ) + "\n" );
            }
            
            fr.close();
            out.close();
        }
        catch( FileNotFoundException e )
        {
            e.printStackTrace();
        }
        catch( IOException e )
        {
            e.printStackTrace();
        }
    }
}
