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.IOException;
import java.io.BufferedReader;
import java.io.FileReader;
import java.util.StringTokenizer;
import java.util.Hashtable;
import java.util.Arrays;

class Triplet {
	public int first;
	public int second;
	public int third;
	
	public Triplet(int one, int two, int three) {
		first = one;
		second = two;
		third = three;
	}
	
	public boolean isSurprising() {
		if ((Math.abs(third - second) == 2) || (Math.abs(second - first) == 2)
				||(Math.abs(third - first) == 2)) {
			return true;
		} else {
			return false;
		}
	}
	
	public int getMax() {
		return Math.max(first, Math.max(second, third));
	}
	
	public String print() {
		return first + " " + second + " " + third;
	}
}

public class Dancers {
	
	private static Triplet getCombo1(int number) {
		int remainder = number % 3;
		if (remainder == 0) {
			return new Triplet(number/3,number/3, number/3);
		} else {
			int first = (number + (3 - remainder)) / 3;
			int second = first - 1;
			int third = number - first - second;
			return new Triplet(first, second, third);
		}
	}
	
	private static Triplet getCombo2(int number) {
		int remainder = number % 3;
		int first, second, third;
		if (remainder == 0) {
			first = (number / 3) + 1;
			second = first - 1;
			third = number - first - second;

		} else {
			first = (number - remainder) / 3;
			second = first - 1;
			third = number - first - second;
		}
		if (second < 0) {
			second++;
			first--;
		}
		if (third < 0) {
			first--;
			third++;
		}
		if (first < 0) { 
			first++; third--;
		}
		if (third - second > 2) {
			second++; third--;
		}
		if (first > 10) {
			first--; second++;
		}
		if (second > 10) {
			second --; third++;
		}
		if (third > 10) {
			third--;second++;
		}
		return new Triplet(first, second, third);
	}
	
	public static void main(String[] args) throws IOException{
		Triplet[] combo1 = new Triplet[31];
		Triplet[] combo2 = new Triplet[31];
		
		for (int i=0;i<=30;i++) {
			//System.out.print("i: " + i);
			combo1[i] = getCombo1(i);
			//System.out.println(" " + combo1[i] .print());
			//System.out.print("i: " + i);
			combo2[i] = getCombo2(i);
			//System.out.println(" " + combo2[i] .print());
		}
		if (args.length != 1) {
			System.out.println("Error: incorrect number of arguments.");
			System.out.println("Usage: Dancers <input-filename>");
		} else {
			BufferedReader inputStream = null;
			try {
				 inputStream = new BufferedReader(new FileReader(args[0]));
				 int totalCases = Integer.valueOf(inputStream.readLine()).intValue();
				 //System.out.println("Total number of cases is: "+totalCases);
				 for (int i=0;i<totalCases;i++) {
					int outputCount = 0;
					System.out.print("Case #"+(i+1)+": ");
					String numbersLine = inputStream.readLine();
					//System.out.println("Numbers line is: "+numbersLine);
					String[] theNumbers = numbersLine.split(" ");
					int numGooglers = Integer.valueOf(theNumbers[0]);
					//System.out.println("Number of googlers " + numGooglers);
					int numSurprises = Integer.valueOf(theNumbers[1]);
					//System.out.println("Number of surprises " + numSurprises);
					int bestReqd = Integer.valueOf(theNumbers[2]);
					//System.out.println("Best required " + bestReqd);
					int output = 0;
					for (int j=0;j<numGooglers; j++) {
						//System.out.println("Googler " + (j+1) + " score " + theNumbers[3+j]);
						Triplet googCombo1 = combo1[Integer.valueOf(theNumbers[3+j])];
						Triplet googCombo2 = combo2[Integer.valueOf(theNumbers[3+j])];
						//System.out.println("Max from googComb1 is " + googCombo1.getMax());
						//System.out.println("Max from googComb2 is " + googCombo2.getMax());
						if (googCombo1.getMax()>=bestReqd && !googCombo1.isSurprising()) {
							output++;
						} else if (googCombo2.getMax()>=bestReqd && !googCombo2.isSurprising()) {
							output++;
							break;
						} else if (googCombo2.getMax()>=bestReqd && googCombo2.isSurprising() && numSurprises>0) {
							output++;
							numSurprises--;
						}
					}
					//System.out.println("*** Answer is " + output + "****");
					System.out.println(output);
					//System.out.println("**********************************");
				 }
			} catch (IOException e) {
				System.out.println("Error in reading file");
			} finally {
				if (inputStream != null) {
					inputStream.close();
				}
			}
			
		}
	}
}