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.*;
import java.util.*;

public class Run
{

	private static class GooglerRating {
		int total;
		int r1, r2, r3;
		int r1s, r2s, r3s;
		
		public GooglerRating ( int totalRating ) {
			total = totalRating;
			
			int mod = totalRating % 3;
			switch ( mod )
			{
				case 0 :
					r3 = r2 = r1 = totalRating / 3;
					r1s = r1 - 1;
					r2s = r2;
					r3s = r3 + 1;
					break;
				case 1 :
					r3 = r2 = r1 = totalRating / 3;
					r3++;
					r1s = r1 - 1;
					r2s = r2 + 1;
					r3s = r3;
					break;
				case 2 :
					r3 = r2 = r1 = totalRating / 3;
					r1++;
					r2++;
					r1s = r1-1;
					r2s = r2-1;
					r3s = r3+2;
				default:
					break;
			}
			
			if ( totalRating == 0 )
			{
				r3s = r2s = r1s = r3 = r2 = r1 = 0;
			}
			if ( totalRating == 1 )
			{
				r3s = r2s = r1s = r3 = r2 = r1 = 0;
				r3s = r3 = 1;
			}
		}
		
		public int bestResult ( ) {
			return Math.max ( r1, Math.max ( r2, r3 ) );
		}
		public int bestSurpriseResult ( ) {
			return Math.max ( r1s, Math.max ( r2s, r3s ) );
		}
		
		public String toString () {
			return "[(" + r1 + ", " + r2 + ", " + r3 + "), " + "(" + r1s + ", " + r2s + ", " + r3s + ")*]";
		}
	}
	
	private static class ProblemInstance {
		int numGooglers;
		int numSurprises;
		int possibleBestResult;
		
		List <GooglerRating> ratings;
		
		public static ProblemInstance from ( String testCase ) {
			ProblemInstance p = new ProblemInstance ();
			
			String[] tokens = testCase.split("\\s+");
			
			p.numGooglers = Integer.parseInt ( tokens[0] );
			p.numSurprises= Integer.parseInt ( tokens[1] );
			p.possibleBestResult = Integer.parseInt ( tokens[2] );
			
			p.ratings = new ArrayList < GooglerRating > ( p.numGooglers );
			
			for ( int googlerIndex = 0; googlerIndex < p.numGooglers; googlerIndex++ ) {
				p.ratings.add ( new GooglerRating ( Integer.parseInt ( tokens[3 + googlerIndex] ) ) );
			}
			
			return p;
		}
		
		public String toString () {
			return "Find the number of ratings that have the best result >= " + possibleBestResult + " with " + numSurprises + " surprises\n\tRatings = " + ratings.toString();
		}
	}
	
	private static String readFile ( String[] args ) {
		StringBuilder text = new StringBuilder();
		try {
			Scanner scanner = new Scanner(new File ( args[0] ));
			while (scanner.hasNextLine())
			{
				text.append(scanner.nextLine() + '\n');
			}
		}
		catch ( Exception e )
		{
			
		}
		finally
		{
		}
		return text.toString();
	}
	
	private static void p ( Object o ) {
		System.out.println ( o );
	}
	public static void main(String[] args) {
		String fileText = readFile ( args );
		Scanner s = new Scanner ( fileText );
		int numTests = Integer.parseInt(s.nextLine ());
		
		for (int testIndex = 1; testIndex <= numTests; testIndex++) {
			String testCase = s.nextLine();
			ProblemInstance p = ProblemInstance.from ( testCase );
			// p ( p.toString() );
			
			List < GooglerRating > allRatings = new ArrayList < GooglerRating > ( p.ratings );
			
			// Find ones that work without surprise			
			int bestWithoutSurprise = 0;
			for ( int i = allRatings.size() - 1; i >= 0; i-- )
			{
				GooglerRating rating = allRatings.get(i);
				if ( rating.bestResult() >= p.possibleBestResult )
				{
					bestWithoutSurprise++;
					allRatings.remove ( i );
				}
			}
			
			// find number of ones that work with surprise
			int bestWithSurprise = 0;
			for ( GooglerRating rating : allRatings )
			{
				if ( rating.bestSurpriseResult () >= p.possibleBestResult )
					bestWithSurprise++;				
			}
			
			int totalPassing = bestWithoutSurprise + Math.min ( bestWithSurprise, p.numSurprises );
			p ( "Case #" + testIndex + ": " + totalPassing );
		}
	}
}