/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}

import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintStream;
import java.util.Scanner;


public class DancingWithGooglers {

	public static void main(String[] args) {
		PrintStream theOut=null;
		try {
			FileOutputStream o = new FileOutputStream("./output.txt", false);
			theOut = new PrintStream(o);
		}
		catch (Exception e) {
			e.printStackTrace();
			return;
		}


		Scanner sc=null;
		try {
			//sc = new Scanner(new File("./A-small.in"));
			sc = new Scanner(new File("/home/duck/Downloads/B-small-attempt0.in"));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
		int NbGooglers;
		int max;
		int surprising;
		int nbCases = sc.nextInt();

		mainloop: for(int curCase=1; curCase <= nbCases ;++curCase) {
			sc.nextLine();
			NbGooglers = sc.nextInt();
			surprising = sc.nextInt();
			max = sc.nextInt();
			int res=0;
			for (int i = 0; i < NbGooglers; i++) {
				int tot = sc.nextInt();
				if(tot%3 == 0) {
					if(tot/3 >= max) {res++;continue;}
					if(tot/3+1 >= max && tot >= 3 && surprising >0) {res++;surprising--;continue;}
				}
				else if (tot%3 == 1) {
					if(tot/3+1>= max) res++;
				}
				else if (tot%3 == 2) {
					if(tot/3+1 >= max) {res++;continue;}
					if(tot/3+2 >= max && surprising >0) {res++;surprising--;continue;}
				}
			}


			/*******************************************************************/
			theOut.format("Case #%d: %d\n",curCase,res);
			System.out.format("Case #%d: %d\n",curCase,res);





		}

	}
}
