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.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

public class B {
	public void solve( Scanner sc, PrintWriter pw ) {
		int tests = sc.nextInt( ); sc.nextLine( );
		for ( int i = 0 ; i < tests; i++ ) {
			int googlers = sc.nextInt( );
			int suprises = sc.nextInt( );
			int minScore = sc.nextInt( );
			
			int minimumNsFoundIn = (((3*minScore)-2) > 0 ) ? ((3*minScore)-2) : 0;
			int minimumSFoundIn = (((3*minScore)-4) > 0 ) ? ((3*minScore)-4) : 2;
			int out = 0;
			
			int[]scores = new int[googlers];
			for ( int j = 0 ; j < googlers; j++ ) {
				scores[j] = sc.nextInt( );
			}
			Arrays.sort( scores );
			for ( int j = 0 ; j < scores.length; j++ ) {
				int score = scores[j];
				if ( score >= minimumNsFoundIn ) {
					out++;
				} else if ( suprises > 0 && score >= minimumSFoundIn ) {
					out++;
					suprises--;
				}
			}
			pw.println( "Case #" + (i+1) + ": " + out );
			pw.flush( );
		}
	}

	public static void main ( String[] args ) throws IOException {
		Scanner sc = new Scanner(new FileReader("B-small-attempt0.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("B-small-attempt0.out"));
		new B( ).solve( sc, pw );
		pw.close( );
		sc.close( );
	}

//	public final static HashMap<Integer, String> NON_SUPRISING = new HashMap<Integer, String>( );
//	public final static HashMap<Integer, String> SUPRISING = new HashMap<Integer, String>( );
//	static {
//		//target = ( 3k-2 > 0 ) ? 3k-2 : 0;
//		//0 = 
//		//0 = 0
//		//1 = 1
//		//2 = 4
//		//3 = 7
//		//4 = 10
//		//5 = 13
//		//6 = 16
//		//7 = 19
//		//8 = 22
//		//9 = 25
//		//10 = 28
//		NON_SUPRISING.put( 0, "0 0 0" );
//		NON_SUPRISING.put( 1, "0 0 1" );
//		NON_SUPRISING.put( 2, "0 1 1" );
//		NON_SUPRISING.put( 3, "1 1 1" );
//		NON_SUPRISING.put( 4, "1 1 2" );
//		NON_SUPRISING.put( 5, "1 2 2" );
//		NON_SUPRISING.put( 6, "2 2 2" );
//		NON_SUPRISING.put( 7, "2 2 3" );
//		NON_SUPRISING.put( 8, "2 3 3" );
//		NON_SUPRISING.put( 9, "3 3 3" );
//		NON_SUPRISING.put( 10, "3 3 4" );
//		NON_SUPRISING.put( 11, "3 4 4" );
//		NON_SUPRISING.put( 12, "4 4 4" );
//		NON_SUPRISING.put( 13, "4 4 5" );
//		NON_SUPRISING.put( 14, "4 5 5" );
//		NON_SUPRISING.put( 15, "5 5 5" );
//		NON_SUPRISING.put( 16, "5 5 6" );
//		NON_SUPRISING.put( 17, "5 6 6" );
//		NON_SUPRISING.put( 18, "6 6 6" );
//		NON_SUPRISING.put( 19, "6 6 7" );
//		NON_SUPRISING.put( 20, "6 7 7" );
//		NON_SUPRISING.put( 21, "7 7 7" );
//		NON_SUPRISING.put( 22, "7 7 8" );
//		NON_SUPRISING.put( 23, "7 8 8" );
//		NON_SUPRISING.put( 24, "8 8 8" );
//		NON_SUPRISING.put( 25, "8 8 9" );
//		NON_SUPRISING.put( 26, "8 9 9" );
//		NON_SUPRISING.put( 27, "9 9 9" );
//		NON_SUPRISING.put( 28, "9 9 10" );
//		NON_SUPRISING.put( 29, "9 10 10" );
//		NON_SUPRISING.put( 30, "10 10 10" );
//		
//		//target = 
//		//target = (3k - 4) > 0 ? 3k - 4 : 2
//		//0 = 2
//		//1 = 2
//		//2 = 2
//		//3 = 5
//		//4 = 8
//		//5 = 11
//		//6 = 14
//		//7 = 17
//		//8 = 20
//		//9 = 23
//		//10 = 26
//		SUPRISING.put( 2, "0 0 2" );
//		SUPRISING.put( 3, "0 1 2" );
//		SUPRISING.put( 4, "0 2 2" );
//		SUPRISING.put( 5, "1 1 3" );
//		SUPRISING.put( 6, "1 2 3" );
//		SUPRISING.put( 7, "1 3 3" );
//		SUPRISING.put( 8, "2 2 4" );
//		SUPRISING.put( 9, "2 3 4" );
//		SUPRISING.put( 10, "2 4 4" );
//		SUPRISING.put( 11, "3 3 5" );
//		SUPRISING.put( 12, "3 4 5" );
//		SUPRISING.put( 13, "3 5 5" );
//		SUPRISING.put( 14, "4 4 6" );
//		SUPRISING.put( 15, "4 5 6" );
//		SUPRISING.put( 16, "4 6 6" );
//		SUPRISING.put( 17, "5 5 7" );
//		SUPRISING.put( 18, "5 6 7" );
//		SUPRISING.put( 19, "5 7 7" );
//		SUPRISING.put( 20, "6 6 8" );
//		SUPRISING.put( 21, "6 7 8" );
//		SUPRISING.put( 22, "6 8 8" );
//		SUPRISING.put( 23, "7 7 9" );
//		SUPRISING.put( 24, "7 8 9" );
//		SUPRISING.put( 25, "7 9 9" );
//		SUPRISING.put( 26, "8 8 10" );
//		SUPRISING.put( 27, "8 9 10" );
//		SUPRISING.put( 28, "8 10 10" );
//	}
}