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 Main {
	
	Scanner in;
	PrintWriter out;
	
	static final String problemName = "B";
	
	static void asserT(boolean e) {
		if (!e) {
			throw new Error();
		}
	}
	
	
	static class Triple {
		int a;
		int b;
		int c;
		
		int max;
		int min;
		
		Triple(int a, int b, int c) {
			this.a = a;
			this.b = b;
			this.c = c;
			
			max = Math.max(a, Math.max(b, c));
			min = Math.min(a, Math.min(b, c));
			asserT(max - min <= 2);
		}
		
		boolean isSurprising() {
			return max - min == 2;
		}
	}
	
	static class Point {
		ArrayList <Triple> list = new ArrayList<Triple>();
		int sMax = -1;
		int uMax = -1;
						
		void add(int a, int b, int c) {
			list.add(new Triple(a, b, c));
		}
		
		int getSurpriseMaximum() {
			if (sMax == -1) {
				sMax = 0;
				for (Triple curr : list) {
					if (curr.isSurprising()) {
						sMax = Math.max(curr.max, sMax);
					}
				}
			}
			return sMax;
		}
		
		int getUsualMaximum() {
			if (uMax == -1) {
				uMax = 0;
				for (Triple curr : list) {
					if (!curr.isSurprising()) {
						uMax = Math.max(curr.max, uMax);
					}
				}
			}
			return uMax;
		}
	}
	
	static final int MAX_COUNT = 100;
	static final int MAX_POINTS = 10;
	
	Point p[] = new Point[31];
	
	int res[][];
	int scores[];
	
	int gen(int idx, int remainSurp, int least) {
		if (idx == -1) {
			if (remainSurp == 0) {
				return 0;
			} else {
				return Integer.MIN_VALUE / 10;
			}
		}
		if (res[idx][remainSurp] != -1) {
			return res[idx][remainSurp];
		}
		int ans = 0;
		int score = scores[idx];
		int maxSurp = p[score].getSurpriseMaximum();
		int maxUsual = p[score].getUsualMaximum();
		
		if (remainSurp != 0) {
			if (maxUsual >= least || maxSurp >= least) {
				ans++;
			}
			ans += gen(idx - 1, remainSurp - 1, least);
		} 
		int ans2 = 0;
		if (maxUsual >= least) {
			ans2++;
		}
		ans2 += gen(idx - 1, remainSurp, least);
		
		res[idx][remainSurp] = Math.max(ans, ans2);
		return res[idx][remainSurp];
	}
	
	
	int solveOne() {
		scores = new int[in.nextInt()];
		int nSurprising = in.nextInt();
		int least = in.nextInt();
		for (int i = 0; i < scores.length; i++) {
			scores[i] = in.nextInt();
		}
		
		res = new int[scores.length][nSurprising + 1];
		for (int []ar : res) {
			Arrays.fill(ar, -1);
		}
		
		return gen(scores.length - 1, nSurprising, least);
	}
	
	void solve() {
		for (int i = 0; i < p.length; i++) {
			p [i] = new Point();
		}
		for (int i = 0; i <= 10; i++) {
			for (int j = i; j <= 10; j++) {
				for (int k = j; k <= 10; k++) {
					if (k - i <= 2) {
						int sum = i + j + k;
						p[sum].add(i, j, k);
					}
				}
			}
		}
		
		int nTests = in.nextInt();
		in.nextLine();
		for (int i = 0; i < nTests; i++) {
			out.println("Case #" + (i+1) + ": " + solveOne());
		}
	}
	
	void run() {
		try {
			in = new Scanner(new FileReader("C:/GCJ/" + problemName + ".in"));
			out = new PrintWriter(new FileWriter("C:/GCJ/" + problemName + ".out"));
		} catch (IOException e) {
			in = new Scanner(System.in);
			out = new PrintWriter(System.out);
		//	throw new Error();
		}
		
		try {
			solve();
		} finally {
			out.close();
		}
	}

	public static void main(String[] args) {
		new Main().run();
	}
}