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);
        }
    }
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package solution;

import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.util.Arrays;
import java.util.Enumeration;
import java.util.Hashtable;

/**
 *
 * @author 144key (tux_daemon)
 */
public class Main {
    // Problem 2 : B. Dancing With the Googlers
    public static Hashtable surpriseCombination = null;
    public static int nbCombinationPosition = 0;
    public static void comb(int[] items) {
        Arrays.sort(items);
        for (int k = 1; k <= items.length; k++) {
            kcomb(items, 0, k, new int[k]);
        }
    }
    public static void kcomb(int[] items, int n, int k, int[] arr) {
        if (k == 0) {            
            if (surpriseCombination != null && arr.length == nbCombinationPosition) {                
                int[] ret = new int[nbCombinationPosition];
                for (int ii = 0; ii < nbCombinationPosition; ii++) {
                    ret[ii] = arr[ii];
                }
                // System.out.println("COMBI : "+Arrays.toString(ret));
                surpriseCombination.put(Arrays.toString(ret), ret);
            }
        } else {
            for (int i = n; i <= items.length - k; i++) {
                arr[arr.length - k] = items[i];
                kcomb(items, i + 1, k - 1, arr);
            }
        }
    }    
    public static boolean inArray(int val, int[] set) {
        int nbElmt = set.length;
        for (int i = 0; i < nbElmt; i++)
            if (set[i] == val) return true;
        return false;
    }
    public static void dancingWithGooglers(String fileIn, String fileOut) {
        try {
            FileInputStream fis = new FileInputStream(new File(fileIn));
            FileOutputStream fos = new FileOutputStream(new File(fileOut));
            int chars = 0;
            StringBuffer tmpStrLine = null;
            int nbCase = 0;
            int processedCase = 1;
            int guide = 0;
            while ((chars != -1) && ((nbCase == 0) || (processedCase <= nbCase))) {
                tmpStrLine = new StringBuffer();
                while (((chars = fis.read()) != -1) && (((char) chars) != '\n')) {
                    tmpStrLine.append((char) chars);
                }
                if (guide == 0) { // searching for nbCase
                    nbCase = Integer.parseInt(tmpStrLine.toString());
                    guide = 1;
                } else if (guide == 1) { // process
                    // init
                    String[] tmp = tmpStrLine.toString().split("\\s");
                    int nbGooglers = Integer.parseInt(tmp[0]);
                    int nbSurpriseResult = Integer.parseInt(tmp[1]);
                    int minPoint = Integer.parseInt(tmp[2]);
                    int[] googlerTotalPoints = new int[nbGooglers];
                    for (int i = 3; i < (nbGooglers+3); i++) {
                        googlerTotalPoints[i-3] = Integer.parseInt(tmp[i]);
                    }
                    // process
                    int[][] googlerPoints = new int[nbGooglers][3];
                    int numberOfQualifiedMinResult = 0; // ====================================
                    if (nbSurpriseResult > 0) {
                        surpriseCombination = new Hashtable();
                        nbCombinationPosition = nbSurpriseResult;
                        int[] googlers = new int[nbGooglers];
                        for (int i = 0; i < nbGooglers; i++) {
                            googlers[i] = i;
                        }
                        comb(googlers);
                        if (surpriseCombination != null) {
                            Enumeration e = surpriseCombination.elements();
                            int tmpNumberOfQualifiedMinResult = 0;
                            int[] surprisePosition = null;
                            int nbCombiProcess = 0;
                            while (e.hasMoreElements()) {                                
                                tmpNumberOfQualifiedMinResult = 0;
                                surprisePosition = (int[]) e.nextElement();
                                for (int i = 0; i < nbGooglers; i++) {
                                    // init point
                                    int basePoint = googlerTotalPoints[i] / 3;
                                    int sharedPoint = googlerTotalPoints[i] % 3;                                    
                                    for (int j = 0; j < 3; j++) {
                                        googlerPoints[i][j] = basePoint + (sharedPoint > 0 ? 1 : 0);
                                        sharedPoint--;
                                    }
                                    // surprisezation
                                    if (inArray(i, surprisePosition)) {
                                        if (googlerPoints[i][0] == googlerPoints[i][1] && googlerPoints[i][0] > 0 && googlerPoints[i][0] < 10) {
                                            googlerPoints[i][0]++;
                                            googlerPoints[i][1]--;
                                        } else if (googlerPoints[i][1] == googlerPoints[i][2] && googlerPoints[i][1] > 0 && googlerPoints[i][1] < 10) {
                                            googlerPoints[i][1]++;
                                            googlerPoints[i][2]--;
                                        } else if (googlerPoints[i][0] == googlerPoints[i][2] && googlerPoints[i][0] > 0 && googlerPoints[i][0] < 10) {
                                            googlerPoints[i][0]++;
                                            googlerPoints[i][2]--;
                                        } 
                                    }
                                    // check
                                    boolean checked = false;
                                    for (int j = 0; j < 3; j++) {
                                        if (googlerPoints[i][j] >= minPoint && !checked) {
                                            tmpNumberOfQualifiedMinResult++;
                                            checked = true;
                                        }
                                    }
                                    // System.out.println("HADSURPRISE :: " + nbCombiProcess + " : " + Arrays.toString(surprisePosition) + " : " + Arrays.toString(googlerPoints[i]));
                                }
                                if (tmpNumberOfQualifiedMinResult > numberOfQualifiedMinResult) {
                                    numberOfQualifiedMinResult = tmpNumberOfQualifiedMinResult;
                                }
                                nbCombiProcess++;
                            }
                        }
                    } else {                        
                        for (int i = 0; i < nbGooglers; i++) {
                            // init point and check
                            int basePoint = googlerTotalPoints[i] / 3;
                            int sharedPoint = googlerTotalPoints[i] % 3;
                            boolean checked = false;
                            for (int j = 0; j < 3; j++) {
                                googlerPoints[i][j] = basePoint + (sharedPoint > 0 ? 1 : 0);
                                sharedPoint--;
                                if (googlerPoints[i][j] >= minPoint && !checked) {
                                    numberOfQualifiedMinResult++;
                                    checked = true;
                                }                                
                            }
                            // System.out.println("NOSURPRISE : " + Arrays.toString(googlerPoints[i]));
                        }
                    }
                    // output result
                    fos.write(("Case #"+processedCase+": "+numberOfQualifiedMinResult+"\n").getBytes());
                    // back to search tmpCredit
                    processedCase++;
                }
            }
            fis.close();
            fos.close();
        } catch (FileNotFoundException e) {
            System.err.println("FileNotFound : " + e);
        } catch (IOException e) {
            System.err.println("IOException : " + e);
        } catch (Exception e) {
            System.err.println("Other Exception : " + e);
        }
    }

    /**
     * @param args the command line arguments
     **/
    public static void main(String[] args) {
        // TODO code application logic here
        dancingWithGooglers("B-small-attempt0.in", "B-small-attempt0.out");
    }
}
