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.util.Scanner;

public class Dance
{
    public static void main(String[] args)
    {
        Scanner jin=new Scanner(System.in);
        int numtries=jin.nextInt();

        jin.nextLine();
        for(int line=0; line<numtries; line++)
        {
            jin.nextInt();

            int surprises=jin.nextInt(), goal=jin.nextInt(), impossible=0;
            //System.out.println(jin.nextLine());
            String[] totals=jin.nextLine().substring(1).split(" ");
            //for(String it : totals) System.out.println(it);

            System.out.print("Case #"+(line+1)+": ");
            for(String each : totals)
            {
                //System.out.println("DEBUG: "+each);
                int total=Integer.parseInt(each), surprising=surprising(total, goal);

                //if(surprising) {surprises--; System.out.println(total+" comes as a surprise");}
                if(surprising!=1) //either tough or impossible
                {
                    if(surprising==0) surprises--; //System.out.println(total+" surprising");}
                    else impossible++; //System.out.println(total+" impossible");} //don't lose allowed surprises for impossibilities
                }
                //else System.out.println(total+" easy");
            }
            if(surprises>=0) System.out.print(totals.length-impossible);
            else System.out.print(totals.length+surprises-impossible);
            System.out.println();
        }
    }

    private static int surprising(int totalPoints, int bestScore)
    {
        if(bestScore>totalPoints) return -1; //impossible ... I can't score that well!

        double remaining=(totalPoints-bestScore)/2.0;

        if(remaining==bestScore) return 1; //unsurprising
        else if(remaining<bestScore) //return bestScore-(int)remaining<=1?1:0; //unsurprising or surprising, round down
        {
            int result=bestScore-(int)remaining;

            if(result<=1) return 1; //unsurprising
            else if(result<=2) return 0; //surprising
            else return -1; //impossible (diff gte 2)
        }
        else /*remaining>bestScore*/ return 1; //unsurprising //(int)(remaining+0.5)-bestScore>1; //round up
    }
}
