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

public class Main {

	/**
	 * @param args
	 * @throws IOException
	 */
	public static void main(String[] args) throws IOException {
		Scanner input = new Scanner(new File("B-small-attempt2.in"));
		FileWriter out = new FileWriter("out.txt");

		int lineNumber = input.nextInt();
		input.nextLine();
		for (int i = 0; i < lineNumber; i++) {
			String solution = "Case #" + (i + 1) + ": ";
			int n = input.nextInt();
			int s = input.nextInt();
			int p = input.nextInt();
			int max = 0;
			int upperLimit = p * 3 - 2;
			int lowerLimit = p * 3 - 4;
			for (int j = 0; j < n; j++) {
				int sum = input.nextInt();
				if (p == 1 && sum >= 1) {
					max++;
				} else if (sum >= upperLimit && sum>p) {
					max++;
				} else if (sum >= lowerLimit && s > 0 && sum>p) {
					s--;
					max++;
				}
			}
			if(p==0)
				max = n;
			solution += max;
			solution += System.getProperty("line.separator");
			;
			out.write(solution);
		}

		out.close();
		input.close();
	}

}
