import java.util.Scanner;
public class B {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for(int zz = 1; zz <= T;zz++){
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			int x = 0;
			for(int i = 0; i < N;i++){
				int score = in.nextInt();
				int best = score/3;
				int mod = score%3;
				int diff = p-best;
				if(diff<1){
					x++;
				}else if(diff<2){
					if(mod==0 && score !=0){
						if(S!=0){
							S--;x++;
						}
					}else if(score!=0){
						x++;
					}
				}else if(diff<3){
					if(mod==2){
						if(S!=0){
							S--;x++;
						}
					}
				}
			}
			System.out.format("Case #%d: %d\n", zz, x);
		}
	}
}


import java.io.PrintWriter;
import java.util.Scanner;

/**
 *
 * @author pulasthi
 */
public class QB12 {

    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        PrintWriter out = new PrintWriter("b.txt");
        int T = sc.nextInt();
        for (int i = 0; i < T; i++) {
            int result = 0;
            int N = sc.nextInt(); //no of googlers
            int S = sc.nextInt();   //surprising
            int p = sc.nextInt();   //max score
            int noSCutoff = p * 3 - 2;
            int sCutoff = p * 3 - 4;
            noSCutoff = Math.max(p, noSCutoff);
            sCutoff = Math.max(p, sCutoff);
            for (int j = 0; j < N; j++) {
                int number = sc.nextInt();
                if (number >= noSCutoff) {
                    result++;
                } else if (S > 0 && number >= sCutoff) {
                    S--;
                    result++;
                }
            }
            out.print("Case #" + (i + 1) + ": ");
            out.println(result);
        }
        out.flush();
        out.close();
    }
}
