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.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Map;

public class ProblemB {
	
	static Map<Integer, Score[]> scores;
	
	public static void main(String[] args){
		
		scores = new HashMap<Integer, Score[]>();
		
		scores.put(0, new Score[]{new Score(0,0,0)});
		scores.put(1, new Score[]{new Score(0,0,1)});
		scores.put(2, new Score[]{new Score(0,0,2),new Score(0,1,1)});
		scores.put(3, new Score[]{new Score(0,1,2),new Score(1,1,1)});
		scores.put(4, new Score[]{new Score(0,2,2),new Score(1,1,2)});
		scores.put(5, new Score[]{new Score(1,1,3),new Score(1,2,2)});
		scores.put(6, new Score[]{new Score(1,2,3),new Score(2,2,2)});
		scores.put(7, new Score[]{new Score(1,3,3),new Score(2,3,3)});
		scores.put(8, new Score[]{new Score(2,2,4),new Score(2,3,3)});
		scores.put(9, new Score[]{new Score(2,3,4),new Score(3,3,3)});
		scores.put(10, new Score[]{new Score(2,4,4),new Score(3,3,4)});
		scores.put(11, new Score[]{new Score(3,3,5),new Score(3,4,4)});
		scores.put(12, new Score[]{new Score(3,4,5),new Score(4,4,4)});
		scores.put(13, new Score[]{new Score(3,5,5),new Score(4,4,5)});
		scores.put(14, new Score[]{new Score(4,4,6),new Score(4,5,5)});
		scores.put(15, new Score[]{new Score(4,5,6),new Score(5,5,5)});
		scores.put(16, new Score[]{new Score(4,6,6),new Score(5,5,6)});
		scores.put(17, new Score[]{new Score(5,5,7),new Score(5,6,6)});
		scores.put(18, new Score[]{new Score(5,6,7),new Score(6,6,6)});
		scores.put(19, new Score[]{new Score(5,7,7),new Score(6,6,7)});
		scores.put(20, new Score[]{new Score(6,6,8),new Score(6,7,7)});
		scores.put(21, new Score[]{new Score(6,7,8),new Score(7,7,7)});
		scores.put(22, new Score[]{new Score(6,8,8),new Score(7,7,8)});
		scores.put(23, new Score[]{new Score(7,7,9),new Score(7,8,8)});
		scores.put(24, new Score[]{new Score(7,8,9),new Score(8,8,8)});
		scores.put(25, new Score[]{new Score(7,9,9),new Score(8,8,9)});
		scores.put(26, new Score[]{new Score(8,8,10),new Score(8,9,9)});
		scores.put(27, new Score[]{new Score(8,9,10),new Score(9,9,9)});
		scores.put(28, new Score[]{new Score(8,10,10),new Score(9,9,10)});
		scores.put(29, new Score[]{new Score(9,10,10)});
		scores.put(30, new Score[]{new Score(10,10,10)});
		
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		
		try{
			
			String line = in.readLine();

			int numLines = Integer.parseInt(line);

			for(int i = 1; i <= numLines; i++){
				
				System.out.print("Case #" + i + ": ");
				
				line = in.readLine();
				
				String[] temp = line.split(" ");
				
				int googlers = Integer.parseInt(temp[0]);
				int specials = Integer.parseInt(temp[1]);
				int p = Integer.parseInt(temp[2]);
				
				System.out.println(maxP(3, googlers+2, 0, specials, p, 0, temp));
				
			}
		}catch(IOException e){
			
		}
	}
	
	public static int maxP(int curGoogler, int maxGoogler, int specUsed, int specTotal, int minP, int numP, String[] scoreAr){
		
		Score[] temp = scores.get(Integer.parseInt(scoreAr[curGoogler]));
		
		if(curGoogler == maxGoogler){
			if(specUsed+1 < specTotal){
				return 0;
			}else if(specUsed == specTotal){
				if(temp.length == 1){
					if(temp[0].getMax() >= minP) return numP+1;
					else return numP;
				}else{
					Score temp1 = temp[0];
					Score temp2 = temp[1];
					if(temp1.isSpecial()){
						if(temp2.getMax() >= minP) return numP+1;
						else return numP;
					}else{
						if(temp1.getMax() >= minP) return numP+1;
						else return numP;
					}
				}
			}else{
				if(temp.length == 1){
					return 0;
				}else{
					Score temp1 = temp[0];
					Score temp2 = temp[1];
					if(temp1.isSpecial()){
						if(temp1.getMax() >= minP) return numP+1;
						else return numP;
					}else{
						if(temp2.getMax() >= minP) return numP+1;
						else return numP;
					}
				}
			}
		}else{
			if(temp.length == 1){
				if(temp[0].getMax() >= minP){
					return maxP(curGoogler+1, maxGoogler, specUsed, specTotal, minP, numP+1, scoreAr);
				}else{
					return maxP(curGoogler+1, maxGoogler, specUsed, specTotal, minP, numP, scoreAr);
				}
			}else{
				Score temp1 = temp[0];
				Score temp2 = temp[1];
				
				int r1;
				if(temp1.getMax() >= minP){
					if(temp1.isSpecial()){
						if(specUsed == specTotal){
							r1 = 0;
						}else{
							r1 = maxP(curGoogler+1, maxGoogler, specUsed+1, specTotal, minP, numP+1, scoreAr);
						}
					}else{
						r1 = maxP(curGoogler+1, maxGoogler, specUsed, specTotal, minP, numP+1, scoreAr);
					}
				}else{
					if(temp1.isSpecial()){
						if(specUsed == specTotal){
							r1 = 0;
						}else{
							r1 = maxP(curGoogler+1, maxGoogler, specUsed+1, specTotal, minP, numP, scoreAr);
						}
					}else{
						r1 = maxP(curGoogler+1, maxGoogler, specUsed, specTotal, minP, numP, scoreAr);
					}
				}
				
				int r2;
				if(temp2.getMax() >= minP){
					if(temp2.isSpecial()){
						if(specUsed == specTotal){
							r2 = 0;
						}else{
							r2 = maxP(curGoogler+1, maxGoogler, specUsed+1, specTotal, minP, numP+1, scoreAr);
						}
					}else{
						r2 = maxP(curGoogler+1, maxGoogler, specUsed, specTotal, minP, numP+1, scoreAr);
					}
				}else{
					if(temp2.isSpecial()){
						if(specUsed == specTotal){
							r2 = 0;
						}else{
							r2 = maxP(curGoogler+1, maxGoogler, specUsed+1, specTotal, minP, numP, scoreAr);
						}
					}else{
						r2 = maxP(curGoogler+1, maxGoogler, specUsed, specTotal, minP, numP, scoreAr);
					}
				}
				
				if(r1 > r2){
					return r1;
				}else{
					return r2;
				}
			}
		}
	}
}

class Score {

	int score1;
	int score2;
	int score3;

	public Score(int s1, int s2, int s3){
		score1 = s1;
		score2 = s2;
		score3 = s3;
	}

	public boolean isSpecial(){
		if(Math.abs(score1-score2) == 2 || Math.abs(score1-score3) == 2 || Math.abs(score2-score3) == 2) return true;
		else return false;
	}

	public int getMax(){
		if(score1 > score2 && score1 > score3) return score1;
		else if(score2 > score3) return score2;
		else return score3;
	}

}