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.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.io.Reader;
import java.io.Writer;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Set;

public class DancingWithTheGooglers {

	public static void main(String[] args) {
		
		if (args.length != 2) {
			System.out.println("Usage: java DancingWithTheGooglers <input-file> <output-file>");
			System.exit(0);
		}
		
		try {
			
			DancingGooglerScoreProcessor processor = 
					new DancingGooglerScoreProcessor(new FileReader(args[0]), new FileWriter(args[1]));
			processor.process();
			
		} catch (Exception e) {
			
			System.out.println("Sorry, there was a fatal error:");
			e.printStackTrace();
			System.exit(0);
		}
	}
}

class DancingGooglerScoreProcessor {
	
	private final BufferedReader reader;
	private final PrintWriter writer;
	
	public DancingGooglerScoreProcessor(Reader in, Writer out) throws IOException {
		
		reader = new BufferedReader(in);
		writer = new PrintWriter(out);
	}
	
	public void process() throws IOException {
		
		String line = reader.readLine();
		int numTests = Integer.parseInt(line);
		
		for (int i = 0; i < numTests; i++) {
			
			line = reader.readLine();
			writer.printf("Case #%d: %d", i + 1, processLine(line));
			writer.println();
		}
		
		writer.flush();
		writer.close();
		reader.close();
	}
	
	private int processLine(String line) {
		
		String[] tokens = line.split(" ");
		int[] scores = new int[Integer.parseInt(tokens[0])];
		int S = Integer.parseInt(tokens[1]);
		int p = Integer.parseInt(tokens[2]);
		for (int i = 0; i < scores.length; i++) {
			scores[i] = Integer.parseInt(tokens[3+i]);
		}
		
		int numSurprises = 0;
		int n = 0;
		
		for (int score : scores) {
			
			Set<Triplet> triplets = getPossibleTriplets(score);
			removeTripletsThatWillNeverHappen(triplets);
			if (hasBestResultOrBetterNoSurprise(p, triplets)) {
				n++;
			} else {
				if (numSurprises < S && hasBestResultOrBetterSurprising(p, triplets)) {
					n++;
					numSurprises++;
				}
			}
		}
		
		return n;
	}
	
	private void removeTripletsThatWillNeverHappen(Set<Triplet> triplets) {
		
		for (Iterator<Triplet> itr = triplets.iterator(); itr.hasNext();) {
			Triplet t = itr.next();
			if (t.willNeverHappen()) {
				itr.remove();
			}
		}
	}
	
	private boolean hasBestResultOrBetterNoSurprise(int bestResult, Set<Triplet> triplets) {
		
		return hasBestResultOrBetter(bestResult, triplets, false);
	}
	
	private boolean hasBestResultOrBetterSurprising(int bestResult, Set<Triplet> triplets) {
		
		return hasBestResultOrBetter(bestResult, triplets, true);
	}
	
	private boolean hasBestResultOrBetter(int bestResult, Set<Triplet> triplets, boolean surprisingAllowed) {
		
		for (Triplet t : triplets) {
			if (t.getBestResult() >= bestResult) {
				if (t.isSurprising() && !surprisingAllowed) {
					continue;
				}
				return true;
			}
		}
		return false;
	}
	
	private Set<Triplet> getPossibleTriplets(int totalScore) {
		
		Set<Triplet> possibleTriplets = new HashSet<Triplet>();
		
		for (int a = 0; a <= 10; a++) {
			for (int b = 0; b <= 10; b++) {
				for (int c = 0; c <= 10; c++) {
					if ((a + b + c) == totalScore) {
						possibleTriplets.add(new Triplet(a, b, c));
					}
				}
			}
		}
		
		return possibleTriplets;
	}
}

class Triplet {
	
	private int[] scores = new int[3];
	private boolean surprising = false;
	private boolean neverHappen = false;
	
	public Triplet(int a, int b, int c) {
		
		scores[0] = a;
		scores[1] = b;
		scores[2] = c;
		Arrays.sort(scores);
		
		int diff1 = scores[2] - scores[0];
		int diff2 = scores[2] - scores[1];
		int diff3 = scores[1] - scores[0];
		surprising =  (diff1 > 1) || (diff2 > 1) || (diff3 > 1);
		neverHappen = (diff1 > 2) || (diff2 > 2) || (diff3 > 2);
	}
	
	public int getBestResult() {
		return scores[2]; //since the array is sorted in ascending order
	}
	
	public boolean isSurprising() {
		return surprising;
	}
	
	public boolean willNeverHappen() {
		return neverHappen;
	}
	
	public boolean equals(Object t) {
		
		if (t == null) {
			return false;
		}
		
		if (!(t instanceof Triplet)) {
			return false;
		}
		
		Triplet that = (Triplet)t;
		return Arrays.equals(scores, that.scores);
	}
	
	public int hashCode() {
		
		return Arrays.hashCode(scores);
	}
	
	public String toString() {
		
		StringBuffer sb = new StringBuffer("[");
		sb.append(scores[0]);
		sb.append(",");
		sb.append(scores[1]);
		sb.append(",");
		sb.append(scores[2]);
		sb.append("]");
		if (isSurprising()) {
			sb.append("*");
		}
		return sb.toString();
	}
}
