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

public class B2012 {
	public static void main(String[] args) throws Exception {
		File f = new File("C:\\gcj\\b_res.txt");
		FileWriter w = new FileWriter(f);
		Scanner sca = new Scanner(new File("C:\\gcj\\b.txt"));
		int T = sca.nextInt();
		for (int i = 0; i < T; i++) {
			int N = sca.nextInt();
			int S = sca.nextInt();
			int p = sca.nextInt();
			int[] t = new int[N];
			int res = 0;
			int puwede = 0;
			for (int j = 0; j < N; j++) {
				t[j] = sca.nextInt();
				if (t[j] >= p * 3 - 2) {
					res++;
				} else if (t[j] >= p * 3 - 4 && p * 3 - 4 > 0) {
					puwede++;
				}
			}
			res += Math.min(puwede, S);
			w.write("Case #" + (i + 1) + ": " + res + "\n");
		}
		w.flush();
		w.close();
	}

}
