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.util.ArrayList;




public class Logic {




	public static void solve() {

		//First input line
		//Texter.readLine();

		int noOfCases = Integer.valueOf(Texter.readLine());




		//Texter.writeText("Output");


		for (int i = 1; i <= noOfCases; i++) {

			int caseNo = i;

			String nextLine = Texter.readLine();

			if (nextLine == null) {

				nextLine = Texter.readLine();
				System.out.println("HHH");
			}
			System.out.println("HHHsda");

			ArrayList<Integer> numbers = Texter.parseNumberList(nextLine);
			//ArrayList<Integer> numbers = (ArrayList<Integer>) numbersOrig.clone();

			ArrayList<Integer[]> triplets = new ArrayList<Integer[]>();


			int noOfGooglers = numbers.get(0);
			int surprises = numbers.get(1);
			int minBest = numbers.get(2);

			numbers.remove(0);
			numbers.remove(0);
			numbers.remove(0);

			for (int q = 0; q < noOfGooglers; q++) {

				int curScore = numbers.get(q);

				triplets.add(crunch(curScore));


			}


			int[] surpriseIndexes = new int[surprises];


			//Count how many above min

			int answer = 0;

			for (int z = 0; z < numbers.size(); z++) {

				if (triplets.get(z)[0] >= minBest) {

					answer++;

				}


			}



			//Loop number of surprises

			ArrayList<Integer> triedOnes = new ArrayList<Integer>();

			for (int t = 0; t < surprises; t++) {

				Integer[] reCrunched = null;

				//while (reCrunched == null) {
				for (int y = 0; y < triplets.size(); y++) {


					int curMin = -1;

					int surpriseIndex = -1;

					//Find the highest one that is below min
					//Start there

					for (int r = 0; r < triplets.size(); r++) {

						if (triedOnes.contains(r)) {
							continue;
						}


						int highestNum = triplets.get(r)[0];

						if (highestNum < minBest && highestNum > curMin) {

							curMin = highestNum;
							//surpriseIndexes[t] = r;
							surpriseIndex = r;

						}

					}

					//Remove so don't find again
					//triplets.remove(surpriseIndex);

					if (surpriseIndex == -1) {

						break;

					}

					triedOnes.add(surpriseIndex);

					//See if it can be made a surprise one

					// + y to account for the number that have been removed
					reCrunched = surpriseCrunch(numbers.get(surpriseIndex));




					if (reCrunched != null) {

						reCrunched = getHighest(reCrunched[0], reCrunched[1], reCrunched[2]);

					}
					//If still too low set to null so will continue looping

					if (reCrunched != null) {

						if (reCrunched[0] < minBest) {

							reCrunched = null;

						}
					}


					if (reCrunched != null) {

						if (reCrunched[0] >= minBest) {

							answer++;
							break;

						}
					}

				}




			}




			Texter.writeText("Case #" + caseNo + ": " + answer);


			//int no = 15;

			//triplets.add(crunch(no));




		}




	}



	static Integer[] crunch(int score) {



		/*for (int i = 10; i >= 0; i--) {
			for (int q = 10; q >= 0; q--) {
				for (int w = 10; w >= 0; w--) {*/


		int i = 10;
		int q = 10;
		int w = 10;


		while (true) {


			if (i + q + w == score) {

				return getHighest(i, q, w);

			}

			w--;

			if (i + q + w == score) {

				return getHighest(i, q, w);

			}

			q--;

			if (i + q + w == score) {

				return getHighest(i, q, w);

			}

			i--;


		}




		/*}
		}
		}*/




	}



	static Integer[] surpriseCrunch(int score) {



		for (int i = 10; i >= 0; i--) {
			for (int q = 10; q >= 0; q--) {
				for (int w = 10; w >= 0; w--) {


					if (i + q + w == score) {

						if (checkSurprise(i, q, w)) {

							return new Integer[] { i, q, w };
						}
					}
				}
			}
		}

		return null;




	}



	static boolean checkSurprise(int i, int q, int w) {

		if (i >= 0 && q >= 0 && w >= 0) {

			//Check if a diff of 2

			if (i - q == 2 || i - w == 2 || q - i == 2 || q - w == 2 || w - i == 2 || w - q == 2) {

				//No greater than 2 diff

				if (i - q <= 2 && i - w <= 2 && q - i <= 2 && q - w <= 2 && w - i <= 2 && w - q <= 2) {

					return true;

				}
			}
		}

		return false;




	}



	static Integer[] getHighest(int i, int q, int w) {

		if (i >= q && i >= w) {

			return new Integer[] { i, q, w };

		}


		if (q >= i && q >= w) {

			return new Integer[] { q, i, w };

		}

		if (w >= i && w >= q) {

			return new Integer[] { w, i, q };

		}


		return null;




	}




}
