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.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Dancing_with_the_googlers {
	public static int s;

	public static int max(int x, int s, final int sMax, int p) {
		int tmp, i = 0, mm = 0, maxx = 0, j = 0, xDIV = 0, min = 1000, k = 0;
		xDIV = Math.round(x / 3);
		mm = 1;
		maxx = xDIV;
		for (i = -1 * mm; i <= mm; i++) {
			for (j = 0; ((j <= mm) && (Math.abs(i - j) <= mm)); j++) {
				for (k = 0; k <= mm; k++) {
					tmp = (xDIV + k) + (xDIV + i) + (xDIV + j);
					// System.out.println("tmp = "+xDIV+" + "+ (xDIV+i)+
					// " + "+(xDIV+j));
					if ((x == tmp) && (xDIV + i >= 0) && ((xDIV + j) >= 0)
							&& ((xDIV + j) <= 10) && ((xDIV + i) <= 10)
							&& ((xDIV + k) >= 0) && ((xDIV + k) <= 10)) {
						if ((xDIV + i) > maxx) {
							maxx = xDIV + i;
						}
						if ((xDIV + i) < min) {
							min = xDIV + i;
						}
						if ((xDIV + j) < min) {
							min = xDIV + j;
						}
						if ((xDIV + j) > maxx) {
							maxx = xDIV + j;
						}
						if ((xDIV + k) < min) {
							min = xDIV + j;
						}
						if ((xDIV + k) > maxx) {
							maxx = xDIV + j;
						}

					}
				}
			}
		}
		if ((maxx < p) && (Dancing_with_the_googlers.s < sMax)) {
			mm = 2;
			// maxx = xDIV;
			for (i = -1 * mm; i <= mm; i++) {
				for (j = 0; (j <= mm) && (Math.abs(i - j) <= mm); j++) {
					for (k = 0; k <= mm; k++) {
						tmp = (xDIV + k) + (xDIV + i) + (xDIV + j);
						// System.out.println("tmp = "+xDIV+" + "+ (xDIV+i)+
						// " + "+(xDIV+j));

						if ((x == tmp) && (xDIV + i >= 0) && ((xDIV + j) >= 0)
								&& ((xDIV + j) <= 10) && ((xDIV + i) <= 10)
								&& ((xDIV + k) >= 0) && ((xDIV + k) <= 10)) {
							if ((xDIV + i) > maxx) {
								maxx = xDIV + i;
							}
							if ((xDIV + i) < min) {
								min = xDIV + i;
							}
							if ((xDIV + j) < min) {
								min = xDIV + j;
							}
							if ((xDIV + j) > maxx) {
								maxx = xDIV + j;
							}
							if ((xDIV + k) < min) {
								min = xDIV + j;
							}
							if ((xDIV + k) > maxx) {
								maxx = xDIV + j;
							}
						}
					}
				}
			}
		}
		if (maxx - min >= 2)
			Dancing_with_the_googlers.s = Dancing_with_the_googlers.s + 1;
		return maxx;
	}

	public static void main(String[] args) {
		String filename = "/myown/developpement/Google_Code_Jam/Dancing_With_the_Googlers.in";
		StringTokenizer st1;
		String ligne = "";
		int T = 0, j = 0, N = 0, S = 0, p = 0, i = 0, s = 0, y = 0;
		s = 0;
		int[] t;
		try {
			FileInputStream fStream = new FileInputStream(filename);
			BufferedReader in = new BufferedReader(new InputStreamReader(
					fStream));
			if (in.ready()) {
				ligne = in.readLine();
				T = Integer.parseInt(ligne);
				for (j = 0; j < T; j++) {
					Dancing_with_the_googlers.s = 0;
					y = 0;
					ligne = in.readLine();
					st1 = new StringTokenizer(ligne, " ");
					N = Integer.parseInt(st1.nextToken());
					S = Integer.parseInt(st1.nextToken());
					p = Integer.parseInt(st1.nextToken());
					t = new int[N];
					for (i = 0; i < N; i++) {
						t[i] = Integer.parseInt(st1.nextToken());
						
						if (max(t[i], s, S, p) >= p)
							y++;
						// System.out.println("Ligne: " + i + " = " + t[i] +
						// " = "+ max(t[i], s, S,p));
					}
					System.out.println("Case #" + (j + 1) + ": " + y);
				}
			}

		} catch (IOException e) {
			System.out.println("File input error");
		}
	}
}
