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.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;


public class Qualification_B {
	
	private static final boolean DEBUG = false;

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {

		List<String> input = readFile(args[0]);
		int testCases = Integer.parseInt(input.get(0));
		String outputFilename = args[0].substring(0, args[0].length() - 2) + "out";
		
		FileOutputStream output = new FileOutputStream(outputFilename);
		
		try {
			for (int i = 1; i <= testCases; i++) {
				
				String[] oneTest = input.get(i).split(" ");
				int noOfGooglers = Integer.parseInt(oneTest[0]);
				int noOfSurprising = Integer.parseInt(oneTest[1]);
				int minPoint = Integer.parseInt(oneTest[2]);
				
				int[] googlerMarks = new int[noOfGooglers];
				for (int j = 0; j < noOfGooglers; j++) {
					googlerMarks[j] = Integer.parseInt(oneTest[3 + j]);
				}

				if (DEBUG) {
					debug("Test Case: " + i);
					debug("===============");
					debug(input.get(i));
				}
				int result = getResult(noOfGooglers, noOfSurprising, minPoint, googlerMarks);

				outputResult(output, i, String.valueOf(result));
			}
		} finally {
			
			if (output != null) {
				output.close();
			}
		}
	}
	
	private static int getResult(final int noOfGooglers,
			final int noOfSurprising, final int minPoint,
			final int[] googlerMarks) {
		
		int result = 0;
		int remainSurprising = noOfSurprising;
		Arrays.sort(googlerMarks);
		int minValue = 0;
		int maxValue = 0;
		int modValue = 0;
		
		for (int i = 0; i < noOfGooglers; i++) {
			minValue = googlerMarks[i] / 3;
			modValue = (minValue == 0)? googlerMarks[i] : googlerMarks[i] % 3;
			if (minValue > 0) {
				maxValue = (modValue == 0)? minValue : minValue + 1;
			} else {
				maxValue = 1;
			}
			
			maxValue = (maxValue > googlerMarks[i])? minValue : maxValue;
			
			if (DEBUG) {
				debug("No: " + noOfGooglers);
				debug("Surprise: " + remainSurprising);
				debug("MinPoint: " + minPoint);
				debug("Mark: " + googlerMarks[i]);
				debug("Min: " + minValue + " - " + "Max: " + maxValue);
				debug("Mod: " + modValue);
			}
				
//			if (maxValue >= minPoint) {
//				debug("Meet: " + googlerMarks[i]);
//				result++;
//			} else {
//				if (remainSurprising > 0 && maxValue < googlerMarks[i]) {
					if (modValue > 0) {
						if (minValue >= minPoint) {
//							debug("Meet: " + googlerMarks[i]);
							result++;
						} else if ((modValue == 1) && (minValue + modValue) == minPoint) {
//							debug("Meet: " + googlerMarks[i]);
							result++;
						} else if ((modValue == 2) && (minValue + 1) >= minPoint) {
//							debug("Meet: " + googlerMarks[i]);
							result++;
						} else if ((remainSurprising > 0) && (minValue + modValue) >= minPoint) {
//							debug("Meet *: " + googlerMarks[i]);
							remainSurprising--;
							result++;
						} else {
//							debug("Does not meet");
//							debug("No: " + noOfGooglers);
//							debug("Surprise: " + remainSurprising);
//							debug("Mark: " + googlerMarks[i]);
//							debug("Min: " + minValue + " - " + "Max: " + maxValue);
						}
					} else {
						if (minValue >= minPoint) {
//							debug("Meet: " + googlerMarks[i]);
							result++;
						} else if (remainSurprising > 0 && minValue > 0 && (minValue + 1) == minPoint) {
//							debug("Meet *: " + googlerMarks[i]);
							remainSurprising--;
							result++;
						} else {
//							debug("Does not meet");
//							debug("No: " + noOfGooglers);
//							debug("Surprise: " + remainSurprising);
//							debug("Mark: " + googlerMarks[i]);
//							debug("Min: " + minValue + " - " + "Max: " + maxValue);
						}
					}
//				}
//			}
		}
		
		return result;
	}

	public static List<String> readFile(String filename) throws IOException {

		List<String> lines = new ArrayList<String>();
		BufferedReader reader = new BufferedReader(new InputStreamReader(
				new FileInputStream(filename)));

		try {
			String data;
			while ((data = reader.readLine()) != null) {
				lines.add(data);
			}
		} finally {
			reader.close();
		}
		
		return lines;
	}
	
	private static void outputResult(FileOutputStream output, int caseNo, String result) throws IOException {
		output.write(String.format("Case #%d: %s\r\n", caseNo, result).getBytes());
//		debug(String.format("Case #%d: %s\r\n", caseNo, result));
	}

	private static void debug(String debug) {
		System.out.print(debug + "\r\n");
	}
}
