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

public class DancinWithGooglers {

    public static void main(String[] args) {
        try {
            Scanner input = new Scanner(new File("input.txt"));
            PrintStream output = new PrintStream(new FileOutputStream("output.txt"));
            solveTask(input, output);
        } catch (FileNotFoundException e) {
            System.out.println("input.txt not found");
        } catch (IOException e) {
            e.printStackTrace();
        }

    }

    private static void solveTask(Scanner input, PrintStream output) {

        int testsCount = input.nextInt();

        for (int test=1; test<=testsCount; test++) {

            int dancersCount = input.nextInt();
            int surprises = input.nextInt();
            int bestResult = input.nextInt();
            int scoreNeeded = bestResult*3-2;

            int gotResultAnywayCount = 0;
            int gotResultConditionallyCount = 0;

            for (int i=0; i<dancersCount; i++) {
                int score = input.nextInt();

                if (score >= scoreNeeded) {
                    gotResultAnywayCount++;
                } else if (score > 1 && score < 29 && score >= scoreNeeded-2) {
                    gotResultConditionallyCount++;
                }
            }

            int total = gotResultAnywayCount + Math.min(gotResultConditionallyCount, surprises);

            System.out.print("Case #"+test+": ");
            System.out.println(total);
            output.print("Case #"+test+": ");
            output.println(total);
        }
    }

}
