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.Arrays;
import java.util.LinkedHashSet;
import java.util.Map;
import java.util.TreeMap;

public class Gcj2 {
	private static Map<Integer, LinkedHashSet<Triplet>> pointsTripletMap = new TreeMap<Integer, LinkedHashSet<Triplet>>();

	private static void loadPointsTripletMap() {
		for (int i = 0; i <= 30; i++) {
			pointsTripletMap.put(Integer.valueOf(i),
					new LinkedHashSet<Triplet>());
		}

		for (int a = 0; a <= 10; a++) {
			for (int b = 0; b <= 10; b++) {
				for (int c = 0; c <= 10; c++) {
					try {
						int pointsSum= a + b + c;
						Triplet triplet = new Triplet(a,b,c);
						pointsTripletMap.get(Integer.valueOf(pointsSum)).add(
								triplet);
					} catch (NotValidTripletRuntimeException ex) {
						//bad practice! 
					}
				}
			}
		}
	}

	static {
		loadPointsTripletMap();
		System.out.println(pointsTripletMap);
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		String input = args[0];
		String output = args[1];

		try {
			File fileInput = new File(input);
			System.out.println(fileInput.getAbsolutePath());
			FileReader fr = new FileReader(fileInput);
			BufferedReader br = new BufferedReader(fr);

			File fileOutput = new File(output);
			FileWriter fw = new FileWriter(fileOutput);
			BufferedWriter bw = new BufferedWriter(fw);

			String numberOfCases = br.readLine();
			Integer n = Integer.parseInt(numberOfCases.trim());

			for (int i = 0; i < n; i++) {
				int result = 0;
				String line = br.readLine();
				String[] lineArgs = line.split(" ");
				int googlers = Integer.parseInt(lineArgs[0]);
				int surprisingTriplets = Integer.parseInt(lineArgs[1]);
				int pointsNumberMin = Integer.parseInt(lineArgs[2]);

				int[] googlersResults = new int[lineArgs.length - 3];
				for (int m = 3; m < lineArgs.length; m++) {
					int mGooglerResult = Integer.parseInt(lineArgs[m]);
					googlersResults[m - 3] = mGooglerResult;
				}

				Arrays.sort(googlersResults);

				for (int m = 0; m < googlersResults.length; m++) {
					LinkedHashSet<Triplet> triplets = pointsTripletMap
							.get(Integer.valueOf(googlersResults[m]));

					Triplet choosenTriplet = null;
					for (Triplet triplet : triplets) {
						if (triplet.getC() >= pointsNumberMin) {
							if (choosenTriplet == null) {
								choosenTriplet = triplet;
							} else if (choosenTriplet.isSurprising()
									&& !triplet.isSurprising()) {
								choosenTriplet = triplet;
							}
						}
					}

					if (choosenTriplet != null) {
						if (!choosenTriplet.isSurprising()) {
							result++;
						} else if (surprisingTriplets > 0) {
							result++;
							surprisingTriplets--;
						}
					}
				}

				String msg = "Case #" + (i + 1) + ": " + result;
				System.out.println(msg);
				if (i > 0) {
					bw.newLine();
				}
				bw.write(msg);

			}

			bw.flush();
			bw.close();
			br.close();
		} catch (IOException e) {
			e.printStackTrace();
		}

	}
}

class Triplet {
	private final int pointsA, pointsB, pointsC;


	public Triplet(int pointsA, int pointsB, int pointsC) {
		int[] ints = new int[3];
		ints[0] = pointsA;
		ints[1] = pointsB;
		ints[2] = pointsC;

		Arrays.sort(ints);

		if (ints[2] - ints[0] > 2) {
			throw new NotValidTripletRuntimeException(
					"Points in triplet can't vary more than 2 points!");
		}

		this.pointsA = ints[0];
		this.pointsB = ints[1];
		this.pointsC = ints[2];
	}

	boolean isSurprising() {
		if (pointsC - pointsA > 1) {
			return true;
		} else {
			return false;
		}
	}

	public int getA() {
		return pointsA;
	}

	public int getB() {
		return pointsB;
	}

	public int getC() {
		return pointsC;
	}

	private int[] getMinMax(int... ints){
		int[] minMax = new int[2];
		minMax[0]=10;
		minMax[1]=0;
		for (int i : ints) {
			minMax[0] = Math.min(minMax[0], i);
			minMax[1] = Math.max(minMax[1], i);
		}
		return minMax;
	}

	@Override
	public int hashCode() {
		// Using Joshua Bloch's recipe:
		int result = 17;
		result = 37 * result + pointsA;
		result = 37 * result + pointsB;
		result = 37 * result + pointsC;
		return result;
	}

	@Override
	public boolean equals(Object obj) {
		if (obj == null) {
			return false;
		}
		if (obj instanceof Triplet) {
			Triplet triplet = (Triplet) obj;
			if (this.getA() == triplet.getA() && this.getB() == triplet.getB()
					&& this.getC() == triplet.getC()) {
				return true;
			}
		}

		return false;
	}

	@Override
	public String toString() {
		return "" + pointsA + "," + pointsB + "," + pointsC;
	}
}

class NotValidTripletRuntimeException extends RuntimeException {
	private static final long serialVersionUID = 1L;

	public NotValidTripletRuntimeException(String message) {
		super(message);
	}

}

