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;
import java.lang.Math;
import java.util.Arrays;

public class DancingWithTheGooglers {
	public static int testSize = 0;
	
	public static int[] convertString2Nums(int n, String str) {
		int[] result = new int[n];
		
		int begIndex = 0;
		int endIndex = 0;
		
		for(int i = 0; i < n - 1; i++) {
			endIndex = str.indexOf(' ', begIndex);
			result[i] = Integer.parseInt(str.substring(begIndex, endIndex));
			begIndex = endIndex + 1;
		}
		result[n - 1] = Integer.parseInt(str.substring(begIndex, str.length()));
		return result;
	}
	
	public static boolean isPossibleScore(int score, int P) {
		if(0 == P) return true;
		if(score < P) return false;
		int remain = (score - P) >> 1;
		if(P - remain > 1)
			return false;
		return true;
	}
	
	public static boolean isSurprisePossible(int score, int P) {
		if(0 == P) return true;
		if(score < P) return false;
		int remain = (score - P) >> 1;
		if(P - remain > 2)
			return false;
		return true;	
	}
	
	public static int maxDancers(String input) {
		int result = 0;
		String[] params = input.split(" ");
		int N = Integer.parseInt(params[0]);
		int S = Integer.parseInt(params[1]);
		int P = Integer.parseInt(params[2]);
		
		int[] a = new int[N];
		int numOfSurprise = 0;
		
		for(int i = 0; i < N; i++) {
			a[i] = Integer.parseInt(params[i + 3]);
		}
		
		Arrays.sort(a);
		for(int i = N - 1; i >= 0 ; i--) {
			if(isPossibleScore(a[i], P)) {
				result++;
			} else {
				if(numOfSurprise < S && isSurprisePossible(a[i], P)) {
					result++;
					numOfSurprise++;
				}
			}
		}
		/*
		
		int i = 0;
		while(a[i] < P ) {
			i++;
			if(i >= N)
				break;
		}
		
		if(i == N)
			return 0;
		
		int j = 0;
		for(j = 0; j < S && j + i < N; j++) {
			result ++;
		}
		
		if(j + i < N) {
			for(int k = j + i; k < N; k++) {
				if(isPossibleScore(a[k], P))
					result++;
			}
		}
		*/
		return result;
	}

	public static void Output(String inPath, String outPath) {
		try {
			FileInputStream fstream = new FileInputStream(inPath);
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			File of = new File(outPath);
			of.delete();
			BufferedWriter bw = new BufferedWriter(new FileWriter(new File(outPath), true));
			
			String line = br.readLine();
			
			int[] parameters = convertString2Nums(1, line);
			int numOfTest = parameters[0];
			
			String str = new String();
			for(int i = 0; i < numOfTest; i ++) {
				line = br.readLine();
				str = new String("Case #" + (i+1) + ": " + maxDancers(line));
				System.out.println(str);
				bw.write(str);
				bw.newLine();
			}	 
			
			in.close();
			bw.close();
		} catch (Exception e){//Catch exception if any
			System.err.println("Error: " + e.getMessage());
		}
	}
	
	//public static 
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		String inFile  = new String();
		String outFile = new String();
		testSize = 1;
		switch(testSize) {
			case 0:
				inFile = new String("./B-test.in");
				outFile = new String("./B-test.out");
				break;
				
			case 1:
				inFile = new String("./B-small-attempt1.in");
				outFile = new String("./B-small-attempt1.out");
				break;
				
			case 2:
				inFile = new String("./A-large-practice.in");
				outFile = new String("./A-large-practice.out");
				break;
			default:
				break;
		}		
		Output(inFile, outFile);
	}


}
