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

public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		Scanner scan = new Scanner(System.in);
		int T = scan.nextInt();

		int counter = 1;
		while (T-- > 0) {
			int returned = 0;
			int N = scan.nextInt();
			int surp = scan.nextInt();
			int theMax = scan.nextInt();
			double[] array = new double[N];
			for (int i = 0; i < array.length; i++) {
				array[i] = scan.nextDouble();
			}
			for (int i = 0; i < array.length; i++) {
				if (Math.ceil((double) array[i] / 3) >= theMax) {
					returned++;
				} else if (array[i] >= theMax) {
					double temp = array[i] - theMax;
					double first = theMax;
					double second = Math.ceil((double) temp / 2);
					double third = temp - second;

					double diff1 = Math.abs(first - second);
					double diff2 = Math.abs(second - third);
					double diff3 = Math.abs(first - third);

					if (diff1 <= 2 && diff2 <= 2 && diff3 <= 2) {
						if (diff1 == 2 || diff2 == 2 || diff3 == 2) {
							if (surp > 0
									&& (first >= theMax || second >= theMax || third >= theMax)) {
								surp--;
								returned++;
							}
						}
					}
				}
			}
			System.out.println("Case #" + counter++ + ": " + returned);
		}
	}
}