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.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;


public class ProblemaB {
	
	private final static String RUTA="C:/Users/Rafael/Documents/Estudio/OtherStuff/Google/CodeJam/ProblemaB/";
	private tripletOfScore[] triples;
	
	public ProblemaB(){
		
		
		inicializarTripleOfScores();
		
		
		try {
			FileOutputStream fos=new FileOutputStream(new File(RUTA+"resultado.txt"));
			BufferedReader br=new BufferedReader(new FileReader(RUTA+"B-small-attempt0.in"));
			PrintWriter pw=new PrintWriter(fos);
			
			String a=br.readLine();
			System.out.println("Ignore"+a);
			int contadorCasos=1;
			
			while((a=br.readLine())!=null)
			{
				String parte[]=a.split(" ");
				int googlers=Integer.parseInt(parte[0]);
				int sps=Integer.parseInt(parte[1]);
				int numeroMayor=Integer.parseInt(parte[2]);
				int contador=0;
				
				for(int i=0;i<googlers;i++){
					int puntajeActual=Integer.parseInt(parte[3+i]);
					tripletOfScore temporal=triples[puntajeActual];
					
					if(temporal.existeAlgunValorMayorPrimero(numeroMayor)){
						contador++;
					}
					else{
						if(sps>0)
						{
							if(temporal.existeAlgunValorMayorSegundo(numeroMayor))
							{
								contador++;
								sps--;
							}
						}
					}
				}
				pw.println("Case #"+contadorCasos+": "+contador);
				contadorCasos++;
			}
			pw.close();
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
	
	
	private void inicializarTripleOfScores() {
		triples=new tripletOfScore[31];
		
		triples[0]=new tripletOfScore(0, 0, 0);
		triples[1]=new tripletOfScore(1, 0, 0);
		triples[2]=new tripletOfScore(1,1,0,2,0,0);
		triples[3]=new tripletOfScore(1,1,1,2,1,0);
		triples[4]=new tripletOfScore(2,1,1,2,2,0);
		triples[5]=new tripletOfScore(2,2,1,3,1,1);
		triples[6]=new tripletOfScore(2,2,2,3,2,1);
		triples[7]=new tripletOfScore(3,2,2,3,3,1);
		triples[8]=new tripletOfScore(3,3,2,4,2,2);
		triples[9]=new tripletOfScore(3,3,3,4,3,2);
		triples[10]=new tripletOfScore(4,3,3,4,4,2);
		triples[11]=new tripletOfScore(4,4,3,5,3,3);
		triples[12]=new tripletOfScore(4,4,4,5,4,3);
		triples[13]=new tripletOfScore(5,4,4,5,5,3);
		triples[14]=new tripletOfScore(5,5,4,6,4,4);
		triples[15]=new tripletOfScore(5,5,5,6,5,4);
		triples[16]=new tripletOfScore(6,5,5,6,6,4);
		triples[17]=new tripletOfScore(6,6,5,7,5,5);
		triples[18]=new tripletOfScore(6,6,6,7,6,5);
		triples[19]=new tripletOfScore(7,6,6,7,7,5);
		triples[20]=new tripletOfScore(7,7,6,8,6,6);
		triples[21]=new tripletOfScore(7,7,7,8,7,6);
		triples[22]=new tripletOfScore(8,7,7,8,8,6);
		triples[23]=new tripletOfScore(8,8,7,9,7,7);
		triples[24]=new tripletOfScore(8,8,8,9,8,7);
		triples[25]=new tripletOfScore(9,8,8,9,9,7);
		triples[26]=new tripletOfScore(9,9,8,10,8,8);
		triples[27]=new tripletOfScore(9,9,9,10,9,8);
		triples[28]=new tripletOfScore(10,9,9,10,10,8);
		triples[29]=new tripletOfScore(10,10,9);
		triples[30]=new tripletOfScore(10,10,10);
		
	}


	/**
	 * @param args
	 */
	public static void main(String[] args) {
			new ProblemaB();
	}
}

class tripletOfScore{
	private int puntajeUno;
	private int puntajeDos;
	private int puntajeTres;
	private int segundoPuntajeUno;
	private int segundoPuntajeDos;
	private int segundoPuntajeTres;
	private int TIPO;
	
	public tripletOfScore(int a, int b, int c){
		puntajeUno=a;
		puntajeDos=b;
		puntajeTres=c;
		TIPO=1;
	}
	
	public tripletOfScore(int a, int b, int c, int a2, int b2, int c2){
		puntajeUno=a;
		puntajeDos=b;
		puntajeTres=c;
		segundoPuntajeUno=a2;
		segundoPuntajeDos=b2;
		segundoPuntajeTres=c2;
		TIPO=2;
	}

	public int getPuntajeUno() {
		return puntajeUno;
	}

	public int getPuntajeDos() {
		return puntajeDos;
	}

	public int getPuntajeTres() {
		return puntajeTres;
	}

	public int getSegundoPuntajeUno() {
		return segundoPuntajeUno;
	}

	public int getSegundoPuntajeDos() {
		return segundoPuntajeDos;
	}

	public int getSegundoPuntajeTres() {
		return segundoPuntajeTres;
	}
	
	public int getTipo() {
		return TIPO;
	}
	
	public boolean existeAlgunValorMayorPrimero(int num){
		if(puntajeUno>=num||puntajeDos>=num||puntajeTres>=num){
			return true;
		}
		else return false;
	}
	
	public boolean existeAlgunValorMayorSegundo(int num){
		if(TIPO==1){
			return false;
		}
		else{
			if(segundoPuntajeUno>=num||segundoPuntajeDos>=num||segundoPuntajeTres>=num){
				return true;
			}
			else return false;
		}
	}
	
}
