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.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
/**
 *
 * @author JOSE
 */
public class DancingWithTheGooglers {

    public void process() {
        ArrayList<String> inputList = readFile("B-small-attempt0.in");
        String output = "";
        int testCase = 0;
        for (int i = 0; i < inputList.size(); i++) {
            String input = inputList.get(i);
            if (i == 0) {
                testCase = Integer.parseInt(input);
            } else {
                int result = eachTestcaseProcess(input);
                output = output + "Case #" + i + ": " + result;
                if (i != (inputList.size() - 1)) {
                    output = output + '\n';
                }
            }
        }
        writeFile(output);
    }

    public int eachTestcaseProcess(String input) {
        // String test = "3 1 5 15 13 11";
        String spliInputt[] = input.split("\\s");
        int googler = 0;
        int serprise = 0;
        int p = 0;
        double[] totalpoint = null;
        int resultCount = 0;

        for (int i = 0; i < spliInputt.length; i++) {
            if (i == 0) {
                googler = Integer.parseInt(spliInputt[i]);
                totalpoint = new double[googler];
            } else if (i == 1) {
                serprise = Integer.parseInt(spliInputt[i]);
            } else if (i == 2) {
                p = Integer.parseInt(spliInputt[i]);
            } else {
                totalpoint[i - 3] = Double.parseDouble(spliInputt[i]);
            }
        }

        int[][] triplet = new int[googler][3];

        for (int i = 0; i < totalpoint.length; i++) {
            double divide = totalpoint[i] / 3;
            double mod = totalpoint[i] % 3;

            triplet[i][0] = (int) divide;
            triplet[i][1] = (int) divide;
            triplet[i][2] = (int) divide;
            for (int j = 0; j < mod; j++) {
                triplet[i][j]++;
            }
        }

        for (int i = 0; i < triplet.length; i++) {
            boolean flag = false;
            int checkSurprising = 0;
            while (checkSurprising != -1) {
                checkSurprising = findSurprising(triplet, i);
                if (checkSurprising != -1) {

                    flag = isEquealOrGreaterThanP(triplet, p, i);
                    if (flag && (checkSurprising != 1 || serprise > 0)) {
                        if (checkSurprising == 1) {
                            serprise--;
                        }
                        resultCount++;
                        checkSurprising = -1;
                    } else {
                        if (triplet[i][1] > 0) {
                            triplet[i][0]++;
                            triplet[i][1]--;
                        } else {
                            checkSurprising = -1;
                        }
                    }
                }
            }
        }

        return resultCount;
    }

    private int findSurprising(int[][] triplet, int i) {
        int a = (triplet[i][0] - triplet[i][1]);
        int b = (triplet[i][0] - triplet[i][2]);
        int c = (triplet[i][1] - triplet[i][2]);
        int result = -1;
        if (a < 2 && b < 2 && c < 2) {
            result = 0;
        } else if ((a <= 2 && b <= 2 && c <= 2)) {
            result = 1;
        }
        return result;
    }

    private boolean isEquealOrGreaterThanP(int[][] triplet, int p, int i) {
        boolean result = false;
        for (int j = 0; j < 3; j++) {
            if (triplet[i][j] >= p) {
                result = true;
            }
        }
        return result;
    }

    private ArrayList<String> readFile(String fileName) {

        BufferedReader br = null;
        ArrayList<String> inputList = null;
        try {
            File file = new File(fileName);
            br = new BufferedReader(new FileReader(file));
            String message = null;
            inputList = new ArrayList<String>();
            while ((message = br.readLine()) != null) {
                inputList.add(message);
            }
        } catch (IOException ex) {
            ex.printStackTrace();
        } finally {
            try {
                br.close();
            } catch (IOException ex) {
                ex.printStackTrace();
            }
            return inputList;
        }
    }

    private void writeFile(String message) {
        BufferedWriter bw = null;
        try {
            File file = new File("Output.txt");
            bw = new BufferedWriter(new FileWriter(file));
            bw.write(message);
        } catch (IOException ex) {
            ex.printStackTrace();
        } finally {
            try {
                bw.close();
            } catch (IOException ex) {
                ex.printStackTrace();
            }
        }
    }

    public static void main(String[] args) {
        DancingWithTheGooglers dwtg = new DancingWithTheGooglers();
        dwtg.process();
    }
}
