/*
 * 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.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Arrays;
import java.util.Scanner;

public class B {

	/**
	 * @param args
	 * @throws IOException
	 */
	public static void main(String[] args) throws IOException {
		// BufferedReader read = new BufferedReader(new InputStreamReader(
		// new FileInputStream(
		// "C:/Users/Ortiga/Downloads/B-small-attempt0.in")));

		BufferedWriter write = new BufferedWriter(new OutputStreamWriter(
				new FileOutputStream("C:/Users/Ortiga/Downloads/outputB.txt")));
		Scanner sc = new Scanner(new InputStreamReader(new FileInputStream(
				"C:/Users/Ortiga/Downloads/B-small-attempt1.in")));
		byte length = sc.nextByte();
		for (byte i = 0; i < length; i++) {
			byte t = sc.nextByte(), s = sc.nextByte(), p = sc.nextByte(), max = 0, getDuringSurp = 0;
			String rit = "Case #" + (i + 1) + ": ";
			byte[] t_i = new byte[t];
			for (byte j = 0; j < t; j++)
				t_i[j] = sc.nextByte();
			Arrays.sort(t_i);
			int sCounter = 0;
			for (byte j = 0; j < t; j++) {
				byte currT_i = t_i[j];
				if (currT_i == 0 && p > 0)
					continue;
				if (sCounter < s) {
					if ((currT_i - 2) % 3 == 0) {
						if ((((currT_i - 2) / 3) + 2 >= p)) {
							max++;
							getDuringSurp++;
						}
						sCounter++;
						continue;
					} else if ((currT_i - 3) % 3 == 0) {
						if ((((currT_i - 3) / 3) + 2 >= p)) {
							max++;
							getDuringSurp++;
						}
						sCounter++;
						continue;
					}
				}
				if ((currT_i - 1) % 3 == 0) {
					if ((((currT_i - 1) / 3) + 1 >= p))
						max++;
					else if (currT_i + 4 / 3 >= p && getDuringSurp < sCounter) {
						sCounter--;
						j--;
					}
				} else if ((currT_i - 2) % 3 == 0) {
					if ((((currT_i - 2) / 3) + 1 >= p))
						max++;
					else if (currT_i + 4 / 3 >= p && getDuringSurp < sCounter) {
						sCounter--;
						j--;
					}
				} else {
					if (currT_i / 3 >= p)
						max++;
					else if (currT_i + 4 / 3 >= p && getDuringSurp < sCounter) {
						sCounter--;
						j--;
					}
				}
			}
			rit += max;
			write.write(rit);
			if (i < length - 1)
				write.newLine();
		}
		sc.close();
		write.close();
	}
}
