/*
 * 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.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashMap;
import java.util.Map;

public class DancingWithGooglers {

	public static void main(String[] args) throws IOException {
		String msg = "";
		BufferedReader br = null;
		String sCurrentLine = null;
		Map<String, String> map = new HashMap<String, String>();
		br = new BufferedReader(new FileReader("test"));
		sCurrentLine = br.readLine();
		int x = 0;
		if (sCurrentLine != null) {
			while ((sCurrentLine = br.readLine()) != null) {
				int qualifiedGooglers = 0;
				msg = "";
				String[] eachTestCase = sCurrentLine.split(" ");
				int noOfGooglers = Integer.parseInt(eachTestCase[0]);
				int noOfSurprises = Integer.parseInt(eachTestCase[1]);
				int minReqd = Integer.parseInt(eachTestCase[2]);
				int[] googlersPoint = new int[noOfGooglers];
				int k = 0;
				for (int i = 3; i < eachTestCase.length; i++) {
					int j = Integer.parseInt(eachTestCase[i]);
					googlersPoint[k++] = j;
				}
				for (int i = 0; i < noOfGooglers; i++) {
					if (googlersPoint[i] == 0) {
						if (minReqd == 0)
							qualifiedGooglers++;
					} else if ((googlersPoint[i] + 2) / 3 >= minReqd) {
						qualifiedGooglers++;
					} else if (noOfSurprises > 0) {
						if ((googlersPoint[i] + 4) / 3 >= minReqd) {
							qualifiedGooglers++;
							noOfSurprises--;
						}

					}
				}
				x++;
				msg += "Case #" + x + ": " + qualifiedGooglers;
				System.out.println(msg);
			}
		}

	}
}
