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.*;
import java.util.*;

public class B {
    public final static String FILE_IN = "B-large.in";
    public final static String FILE_OUT = "B-large.out";

    public static class Case {
        public int n, s, p;
        public int[] t;

        public String toString() {
            return "" + n + "," + s + "," + p + ":" + Arrays.toString(t);
        }
    }

    public static Case readCase(BufferedReader r) throws IOException {
        Case c = new Case();

        String[] tk = r.readLine().split(" ");
        c.n = Integer.parseInt(tk[0]);
        c.s = Integer.parseInt(tk[1]);
        c.p = Integer.parseInt(tk[2]);
        c.t = new int[c.n];
        for (int i=0; i<c.n; i++) {
            c.t[i] = Integer.parseInt(tk[3+i]);
        }

        return c;
    }


    public static void solveCase(Case c, BufferedWriter w, int index) throws IOException {
        int t = 0;
        int sr = c.s;
        for (int i=0; i<c.t.length; i++) {
            int q = c.t[i] / 3;
            int r = c.t[i] % 3;

            if (r == 0) {
                if (q >= c.p) {
                    t++;
                }
                else if (q > 0 && q + 1 >= c.p && sr > 0) {
                    t++;
                    sr--;
                }
            }
            else if (r == 1) {
                if (q+1 >= c.p) {
                    t++;
                }
            }
            else {
                if (q+1 >= c.p) {
                    t++;
                }
                else if (q+2 >= c.p && sr > 0) {
                    t++;
                    sr--;
                }
            }
        }

        w.write("Case #" + (index+1) + ": " + t);
        w.newLine();
    }

    public static void main(String[] args) throws Exception {
        BufferedReader r = new BufferedReader(new FileReader(FILE_IN));
        BufferedWriter w = new BufferedWriter(new FileWriter(FILE_OUT));
        int num = Integer.parseInt(r.readLine());
        for (int i=0; i<num; i++) {
            Case c = readCase(r);
            solveCase(c, w, i);
        }

        w.close();
        r.close();
    }
}