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.BufferedInputStream;
import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.IOException;
import java.io.InputStreamReader;

public class SolutionDance {
    static DataInputStream in = new DataInputStream(new BufferedInputStream(System.in));
    static BufferedReader din = new BufferedReader( new InputStreamReader(in));
    public static void main(String args[]){
        int t = parseInt(getLine());
        String[] g = new String[t];
        int n, s, p; int [] part; String out = "Case #";

        for(int i = 0;i<t;i++){
            g[i] = getLine();
        }
        for(int i = 0;i<t;i++){
            int count = 0;  out = "Case #";
            String[] spl =  g[i].split(" ");
            n =  parseInt(spl[0]);
            s =  parseInt(spl[1]);
            p =  parseInt(spl[2]);
            part = getPart(spl, n, p);
            for(int q = 0;q<n;q++){
                if(part[q]>=0){
                    if(2*p-part[q] <=2){
                        count++;
                    }else{
                        if(2*p-part[q] <=4){
                            if(s>0){
                                s--;
                                count++;
                            }
                        }
                    }
                }
            }
            out = out+(i+1)+": " +count;
            soutln(out);
        }
    }

    private static int[] getPart(String[] spl, int n, int p) {
        int [] part = new int [n];
        for(int i = 0;i<n;i++){
            part[i] =  parseInt(spl[i+3]) - p;
        }
        return part;
    }


    public static String getLine(){
        String input = "";
        try {
            input = din.readLine();
        } catch (IOException e) {
            // TODO Auto-generated catch block
            e.printStackTrace();
        }
        return input;
    }

    public static int parseInt(String s){
        return Integer.parseInt(s);
    }
    
    public static void sout(Object n){
        System.out.print(n);
    }
    public static void soutln(Object n){
        System.out.println(n);
    }
}

