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.DataInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;

//Importing Java.io package classes to perform file management operations

//DANCE OF GOOGLERS

public class DanceOfGooglers
{	
	DanceOfGooglers()
	{
		Combinations combinations[] = new Combinations[31];
		for(int i = 0 ; i < 31 ; i++)
		{
			combinations[i] = new Combinations();
		}
	}

	static void doSort(int G[] , int N)
	{
		for(int i = 0 ; i < (N-1) ; i++)
		{
			int min = i;

			for(int j = (i + 1) ; j < N ; j++)
			{
				if(G[j] < G[min])
				{
					min = j;
				}
			}

			if(min != i)
			{
				int temp = G[min];
				G[min] = G[i];
				G[i] = temp;
			}
		}
	}

	public static void main(String[] args)
	{
		int limit = 30;
		int maxInt = 10;

		//Since there are total 31 Numbers 0-30 (Inclusive)
		Combinations combinations [] = new Combinations[31];

		for(int l = 0 ; l < 31 ; l++)
		{
			combinations[l] = new Combinations();
		}

		for(int sum = 0 ; sum <= limit ; sum++)
		{
			for(int i = 0 ; i <= maxInt ; i++)
			{
				for(int j = 0 ; j <= maxInt ; j++)
				{
					for(int k = 0 ; k <= maxInt ; k++)
					{
						if((i + j + k) > sum)
						{
							break;
						}

						if((i + j + k) == sum)
						{
							combinations[sum].populateSets(i, j, k);
							break;
						}
					}
				}
			}			
		}

		try
		{
			// Open the input file
			FileInputStream fistream = new FileInputStream("B-small-attempt0.in");
			
			// Get the object of DataInputStream
			DataInputStream in = new DataInputStream(fistream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;
			
			//Create output file
			File file = new File("output.out");
			boolean exist = file.createNewFile();
			
			if (!exist)
			{
				System.out.println("File already exists.");
				System.exit(0);
			}
			
			FileWriter fostream = new FileWriter("output.out");
			BufferedWriter out = new BufferedWriter(fostream);
			
			int counter = 0;		//Counter purpose
			
			//Read File Line By Line
			int totalNumberOfCases = 0;
			while ((strLine = br.readLine()) != null)
			{
				if(counter == 0)
				{
					//Ignore the first Line for Conversion
					totalNumberOfCases = Integer.parseInt(strLine);
					counter++;
					continue;
				}
				
				String[] results = strLine.split(" ");
				
				int N = Integer.parseInt(results[0]);
				int S = Integer.parseInt(results[1]);
				int P = Integer.parseInt(results[2]);
				int G[] = new int[N];
				
				//int suprisesRemaining = 0;
				int maxBestResult = 0;
				
				for (int i = 0 ; i < N ; i++)
				{
					G[i] = Integer.parseInt(results[i+3]);
				}
				
				doSort(G , N);
				
				//System.out.println(combinations[G[0]].bestResult[0] + " " + combinations[G[0]].bestResult[1]);
				
				for(int i = 0 ; i < N ; i++)
				{
					if(combinations[G[i]].bestResult[1] < P)	//Non Surprising 
					{
						if(combinations[G[i]].bestResult[0] < P || combinations[G[i]].bestResult[0] == 1000)	//Surprising
						{
							//Ignore
							continue;
						}
						else
						{
							if(S != 0)
							{
								maxBestResult++;
								S--;
							}
						}
					}
					else
					{
						maxBestResult++;			
					}
				}
				
				// Print the content in the output file
				out.write("Case #" + counter + ": " + maxBestResult);
				
				
				//System.out.println(N + " " + S + " " + P + " " + G[0] + " " + G[1] + " " + G[2]);
				/*
				System.out.println("Displaying Combinations");
				System.out.println("=======================");
				
				for(int i = 0 ; i < 31 ; i++)
				{
					combinations[i].displayCombinations(i);
				}
				*/
				
				if(counter < totalNumberOfCases)
				{
					out.write("\n");
				}
				counter++;
			}

			//Close the input stream
			in.close();

			//Close the output Stream
			out.close();

		}
		catch(Exception e)
		{
			//Catch exception if any
			System.err.println("Error: " + e.getMessage() + " : " + e);
		}
	}
}