package dancinggooglers;

import java.io.File;
import java.util.Scanner;

public class DanceScoreCalculator {


    public static void main(String[] args) {
        if(args.length <= 0 || args[0] == null) {
            System.out.println("You must enter a file to read");
            System.out.println("Usage: blah <filename>");
            System.exit(0);
        }

        File argFile = new File(args[0]);
        try {
            Scanner googleSpeakScanner = new Scanner(argFile);
            String firstLine = googleSpeakScanner.nextLine();
            Integer linesToScan = new Integer(firstLine);
            for(int i = 1; i <= linesToScan; i++) {
                String googleDancerLine = googleSpeakScanner.nextLine();
                DanceScoreCase danceCase = new DanceScoreCase(googleDancerLine);
                System.out.println(String.format("Case #%d: %d", i, danceCase.maxDancersThatCouldPass()));
            }
        }
        catch (Exception e) {
            e.printStackTrace();
        }
    }
}

import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        try {
            Scanner in = new Scanner(new FileReader("in.txt"));
            PrintWriter out = new PrintWriter(new FileWriter("out.txt"), true);

            int t = in.nextInt();

            for (int i = 1; i <= t; i++) {
                int res = 0;
                int n = in.nextInt();
                int s = in.nextInt();
                int p = in.nextInt();
                int tt[] = new int[n];
                for (int j = 0; j < n; j++) {
                    tt[j] = in.nextInt();
                }
                if (p == 0) {
                    res = n;
                } else {
                    int min = 3 * p - 2;
                    for (int j = 0; j < n; j++) {
                        if (min <= tt[j]) res++;
                    }
                    int ttt[] = new int[n - res];
                    int itr = 0;
                    for (int j = 0; j < n; j++) {
                        if (min > tt[j]) ttt[itr++] = tt[j];
                    }
                    int minCrazy = 3 * p - 5;
                    int ress = 0;
                    for (int j = 0; j < itr; j++) {
                        if (minCrazy <= ttt[j] && ttt[j] != 0) ress++;
                    }
                    if (ress <= s) {
                        res += ress;
                    } else {
                        res += s;
                    }
                }

                out.println("Case #" + i + ": " + res);
            }
        } catch (Exception e) {
            e.printStackTrace();
        }
    }
}