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

public class B {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner scan = new Scanner(new File("B-small-attempt1.in"));
		System.setOut(new PrintStream("B-small-attempt1.out"));

		int t = scan.nextInt();
		for (int c = 0; c < t; c++) {
			int n = scan.nextInt(); // num
			int s = scan.nextInt(); // surprising
			int p = scan.nextInt(); // best result cutoff
			int[] totalPoints = new int[n];
			for (int i = 0; i < n; i++)
				totalPoints[i] = scan.nextInt();

			int sUsed = 0;
			int ans = 0;
			for (int i = 0; i < n; i++) {
				int pts = totalPoints[i];
				// can it be done normal?
				if (pts >= p + (p - 1) * 2)
					ans++;
				// can it be done surp?
				else if (pts >= p + Math.max(p - 2, 0) * 2)
					if (sUsed < s) {
						ans++;
						sUsed++;
					}
			}

			System.out.printf("Case #%d: %d%n", c + 1, ans);
		}
	}
}