package CodeJam.c2012.clasificacion;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;

/**
 * Problem
 *
 * You're watching a show where Googlers (employees of Google) dance, and then
 * each dancer is given a triplet of scores by three judges. Each triplet of
 * scores consists of three integer scores from 0 to 10 inclusive. The judges
 * have very similar standards, so it's surprising if a triplet of scores
 * contains two scores that are 2 apart. No triplet of scores contains scores
 * that are more than 2 apart.
 *
 * For example: (8, 8, 8) and (7, 8, 7) are not surprising. (6, 7, 8) and (6, 8,
 * 8) are surprising. (7, 6, 9) will never happen.
 *
 * The total points for a Googler is the sum of the three scores in that
 * Googler's triplet of scores. The best result for a Googler is the maximum of
 * the three scores in that Googler's triplet of scores. Given the total points
 * for each Googler, as well as the number of surprising triplets of scores,
 * what is the maximum number of Googlers that could have had a best result of
 * at least p?
 *
 * For example, suppose there were 6 Googlers, and they had the following total
 * points: 29, 20, 8, 18, 18, 21. You remember that there were 2 surprising
 * triplets of scores, and you want to know how many Googlers could have gotten
 * a best result of 8 or better.
 *
 * With those total points, and knowing that two of the triplets were
 * surprising, the triplets of scores could have been:
 *
 * 10 9 10 6 6 8 (*) 2 3 3 6 6 6 6 6 6 6 7 8 (*)
 *
 * The cases marked with a (*) are the surprising cases. This gives us 3
 * Googlers who got at least one score of 8 or better. There's no series of
 * triplets of scores that would give us a higher number than 3, so the answer
 * is 3.
 *
 * Input
 *
 * The first line of the input gives the number of test cases, T. T test cases
 * follow. Each test case consists of a single line containing integers
 * separated by single spaces. The first integer will be N, the number of
 * Googlers, and the second integer will be S, the number of surprising triplets
 * of scores. The third integer will be p, as described above. Next will be N
 * integers ti: the total points of the Googlers.
 *
 * Output
 *
 * For each test case, output one line containing "Case #x: y", where x is the
 * case number (starting from 1) and y is the maximum number of Googlers who
 * could have had a best result of greater than or equal to p.
 *
 * Limits
 *
 * 1 â¤ T â¤ 100. 0 â¤ S â¤ N. 0 â¤ p â¤ 10. 0 â¤ ti â¤ 30. At least S of the ti values
 * will be between 2 and 28, inclusive.
 *
 * Small dataset
 *
 * 1 â¤ N â¤ 3.
 *
 * Large dataset
 *
 * 1 â¤ N â¤ 100.
 *
 * Sample
 *
 * Input Output 4 Case #1: 3 3 1 5 15 13 11 Case #2: 2 3 0 8 23 22 21 Case #3: 1
 * 2 1 1 8 0 Case #4: 3 6 2 8 29 20 8 18 18 21
 *
 * @author Leandro Baena Torres
 */
public class B {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        BufferedReader br = new BufferedReader(new FileReader("B.in"));
        String linea;
        int numCasos, N, S, p, t[], y, minSurprise, minNoSurprise;

        linea = br.readLine();
        numCasos = Integer.parseInt(linea);
        for (int i = 0; i < numCasos; i++) {
            linea = br.readLine();
            String[] aux = linea.split(" ");
            N = Integer.parseInt(aux[0]);
            S = Integer.parseInt(aux[1]);
            p = Integer.parseInt(aux[2]);
            t = new int[N];
            y = 0;
            minSurprise = p + ((p - 2) >= 0 ? (p - 2) : 0) + ((p - 2) >= 0 ? (p - 2) : 0);
            minNoSurprise = p + ((p - 1) >= 0 ? (p - 1) : 0) + ((p - 1) >= 0 ? (p - 1) : 0);
            for (int j = 0; j < N; j++) {
                t[j] = Integer.parseInt(aux[3 + j]);
                if (t[j] >= minNoSurprise) {
                    y++;
                } else {
                    if (t[j] >= minSurprise) {
                        if (S > 0) {
                            y++;
                            S--;
                        }
                    }
                }
            }

            System.out.println("Case #" + (i + 1) + ": " + y);
        }
    }
}

import java.io.*;
import java.util.ArrayList;
import java.util.List;

/**
 * Created by IntelliJ IDEA.
 * User: Leonid
 * Date: 4/14/12
 * Time: 2:41 PM
 * Dancing With Googlers solution
 */
public class DancingWithGooglers {
    public static void main(String[] args) {
        FilesManager fileManager = FilesManager.getFilesManager();
        while (fileManager != null) {
            produceSolution(fileManager);
            fileManager = FilesManager.getFilesManager();
        }

    }

    private static void produceSolution(FilesManager filesManager) {
        FileCommunicationManager fileComManager = new FileCommunicationManager(filesManager);
        List<String> input = fileComManager.convertInputToStrings();
        List<InputInfo> parsedInput = CaseInterpreter.parseInput(input);
        List<String> output = new ArrayList<String>();

        for (int i = 0; i < parsedInput.size(); i++) {
            OutputInfo outputInfo = solve(parsedInput.get(i));
            output.add(CaseInterpreter.composeOutputLine(outputInfo, i + 1));
        }

        fileComManager.convertStringsToOutput(output);
    }

    private static OutputInfo solve(InputInfo inputInfo) {
        OutputInfo outputInfo = new OutputInfo();

        int surpriseThreshold = inputInfo.p * 3 - 4;
        int regularThreshold = inputInfo.p * 3 - 2;
        int surpriseCounter = 0;
        int regularCounter = 0;

        for (int totalResult : inputInfo.results) {
            if (totalResult >= regularThreshold) {
                regularCounter++;
            } else if (totalResult >= surpriseThreshold && totalResult!=0) {
                surpriseCounter++;
            }
        }
        outputInfo.result = regularCounter + (surpriseCounter > inputInfo.s ? inputInfo.s : surpriseCounter);

        return outputInfo;
    }

    private static class InputInfo {
        int n, s, p;
        int[] results;
    }

    private static class OutputInfo {
        int result;

        public String toString() {
            return Integer.toString(result);
        }

    }

    private static class CaseInterpreter {
        private static final int CASE_NUMBER_OF_LINES = 1;

        public static List<InputInfo> parseInput(List<String> input) {
            List<InputInfo> parsedInput = new ArrayList<InputInfo>();
            for (int i = 0; i < input.size(); i += CASE_NUMBER_OF_LINES) {
                parsedInput.add(parseCase(input.subList(i, i + CASE_NUMBER_OF_LINES)));
            }

            return parsedInput;
        }

        private static InputInfo parseCase(List<String> caseLines) {
            InputInfo inputInfo = new InputInfo();
            List<Integer> ints = strToInts(caseLines.get(0));

            inputInfo.n = ints.get(0);
            inputInfo.s = ints.get(1);
            inputInfo.p = ints.get(2);

            inputInfo.results = new int[inputInfo.n];
            for (int i = 0; i < inputInfo.n; i++) {
                inputInfo.results[i] = ints.get(i + 3);
            }

            return inputInfo;
        }

        public static String composeOutputLine(OutputInfo output, int caseNumber) {
            String outputString = "Case #" + caseNumber + ": " + output.toString();

            return outputString;
        }

        private static List<Integer> strToInts(String str) {
            List<Integer> ints = new ArrayList<Integer>();
            String[] strs = str.split(" ");
            for (String s : strs) {
                ints.add(Integer.parseInt(s));
            }
            return ints;
        }
    }

    private static class FilesManager {
        File inputFile;
        File outputFile;
        private static List<String> inputFiles;
        private static int inputFilesIt = 0;

        static {
            File f = new File(".");
            inputFiles = getInputFiles(f.list());
        }

        private static List<String> getInputFiles(String[] fileNames) {
            List<String> inputFileNames = new ArrayList<String>();

            for (String fileName : fileNames) {
                String[] splitFileName = fileName.split("\\.");
                if (splitFileName.length == 2) {
                    if (splitFileName[1].equals("IN") || splitFileName[1].equals("In") || splitFileName[1].equals("in")) {
                        inputFileNames.add(fileName);
                    }
                }
            }
            return inputFileNames;
        }

        private static String generateOutputFileName(String inputFileName) {
            String[] stlitFileName = inputFileName.split("\\.");
            return stlitFileName[0] + "-output.txt";
        }

        FilesManager(String inputFileName, String outputFileName) {
            inputFile = new File(inputFileName);
            assert (inputFile.exists());
            outputFile = new File(outputFileName);
            try {
                outputFile.createNewFile();
            } catch (IOException ex) {
                System.out.println("Exception while trying to create an output file");
            }
        }

        public static FilesManager getFilesManager() {
            if (inputFilesIt >= inputFiles.size()) {
                return null;
            }
            String inputFileName = inputFiles.get(inputFilesIt++);
            String outputFileName = generateOutputFileName(inputFileName);
            return new FilesManager(inputFileName, outputFileName);
        }


        File getInputFile() {
            return inputFile;
        }

        File getOutputFile() {
            return outputFile;
        }
    }

    private static class FileCommunicationManager {
        File inputFile;
        File outputFile;

        FileCommunicationManager(FilesManager filesManager) {
            inputFile = filesManager.getInputFile();
            outputFile = filesManager.getOutputFile();
        }

        List<String> convertInputToStrings() {
            List<String> linesList = new ArrayList<String>();

            try {
                FileReader fr = new FileReader(inputFile);
                BufferedReader bufReader = new BufferedReader(fr);
                int numOfCases = Integer.parseInt(bufReader.readLine());

                for (int i = 0; i < numOfCases; i++) {
                    linesList.add(bufReader.readLine());
                }

            } catch (IOException e) {
                System.out.println("Error reading from the file");
            }

            return linesList;
        }

        void convertStringsToOutput(List<String> linesList) {
            BufferedWriter bufWriter = null;
            try {
                bufWriter = new BufferedWriter(new FileWriter(outputFile));

                for (String line : linesList) {
                    bufWriter.write(line);
                    bufWriter.newLine();
                }

            } catch (IOException e) {
                System.out.println("Error reading from the file");
            } finally {
                //Close the BufferedWriter
                try {
                    if (bufWriter != null) {
                        bufWriter.flush();
                        bufWriter.close();
                    }
                } catch (IOException ex) {
                    ex.printStackTrace();
                }
            }
        }
    }
}
