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.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Collection;


public class Main {
    
    public static void main( String[] args ) {

	try {
	    BufferedReader reader = new BufferedReader( new FileReader( "C:\\file.in") );
	    ArrayList<Integer> results = new ArrayList<Integer>();
	    reader.readLine();
	    String line = reader.readLine();
	    int j = 0;
	    while( line != null ) {
		j++;
		ArrayList<Collection<Triplet>> tripletCollections = new ArrayList<Collection<Triplet>>();
		String[] parameters = line.split( " " );
		int nrOfPlayers = Integer.valueOf( parameters[0] );
		int nrOfSurprises = Integer.valueOf( parameters[1] );
		int treshold = Integer.valueOf( parameters[2] );
		System.out.println("Iteration nr." + String.valueOf( j ));
		System.out.println("Generating triplets for " + String.valueOf( nrOfPlayers ));
		for( int i = 3; i < parameters.length; i++ ) {
		    tripletCollections.add( generateTriplets( Integer.valueOf( parameters[i]) ) );
		}
		System.out.println("Selecting triplets");
		Triplet[] selectedTriplet = new Triplet[nrOfPlayers];
		int surprising = 0;
		for( int i = 0; i < tripletCollections.size(); i++ ) {
		    Collection<Triplet> triplets = tripletCollections.get( i );
		    if( getAboveNotSurprising( triplets, treshold ) != null ) {
			selectedTriplet[i] = getAboveNotSurprising( triplets, treshold );
		    }
		    else if( getAboveAndSurprising( triplets, treshold ) != null ) {
			selectedTriplet[i] = getAboveAndSurprising( triplets, treshold );
			surprising++;
		    }
		    else if( getBelowNotSurprising( triplets, treshold ) != null ) {
			selectedTriplet[i] = getBelowNotSurprising( triplets, treshold );
		    }
		    else {
			selectedTriplet[i] = getBelowAndSurprising( triplets, treshold );
			surprising++;
		    }
		}
		System.out.println("Improving triplets");
		if( nrOfPlayers == 1 ) {
		    System.out.println( "only one player");
		}
		if( surprising != nrOfSurprises ) {
		    if( surprising < nrOfSurprises ) {
			System.out.println("More surprises than expected");
			int i = 0;
			while( ( i < nrOfPlayers ) && ( surprising != nrOfSurprises ) ) {
			    Collection<Triplet> triplets = tripletCollections.get( i );
			    if( !selectedTriplet[i].isSurprising() ) {
				if( getAboveAndSurprising( triplets,  treshold ) != null ) {
				    selectedTriplet[i] = getAboveAndSurprising( triplets,  treshold );
				    surprising++;
				}
			    }
			    i++;
			}
			i=0;
			while( ( i < nrOfPlayers ) && ( surprising != nrOfSurprises ) ) {
			    Collection<Triplet> triplets = tripletCollections.get( i );
			    if( !selectedTriplet[i].isSurprising() ) {
				if( getBelowAndSurprising( triplets,  treshold ) != null ) {
				    selectedTriplet[i] = getBelowAndSurprising( triplets,  treshold );
				    surprising++;
				}
			    }
			    i++;
			}
		    }
		    else {			
			int i=0;
			while( ( i < nrOfPlayers ) && ( surprising != nrOfSurprises ) ) {
			    Collection<Triplet> triplets = tripletCollections.get( i );
			    if( selectedTriplet[i].isSurprising() ) {
				if( getBelowNotSurprising( triplets,  treshold ) != null ) {
				    selectedTriplet[i] = getBelowNotSurprising( triplets,  treshold );
				    surprising--;
				}
			    }
			    i++;
			}
			
		    }
		}
		int result = 0;
		for( Triplet triplet : selectedTriplet ) {
		    if( triplet.getBestResult() >= treshold ) {
			result++;
		    }
		}
		results.add(result);
		line = reader.readLine();
	    }
	    System.out.println("Writing output");
	    BufferedWriter writer = new BufferedWriter( new FileWriter( "C:\\output.txt") );
	    for( int i = 0; i < results.size(); i++ ) {
		writer.write( "Case #" + String.valueOf( i+1 ) + ": " + String.valueOf( results.get( i ) ) );
		writer.newLine();
	    }
	    writer.close();
	}
	catch( Exception e ) {
	    
	}
	

    }
    
    private static Collection<Triplet> generateTriplets( int aSum ) {
	ArrayList<Triplet> result = new ArrayList<Triplet>();
	int temp;
	if( aSum % 3 == 0 ) {
	  result.add( new Triplet( aSum/3, aSum/3, aSum/3 ) );  
	}
	if( (aSum - 1) % 3 == 0  && (aSum - 1) >= 0 ) {
	  temp = ( aSum - 1 ) / 3;
	  if( temp + 1 <= 10 ) {
	      result.add( new Triplet( temp, temp, temp + 1 ) );	      
	  }
	}
	if( (aSum - 2) % 3 == 0 && (aSum - 2) >= 0) {
	    temp = ( aSum - 2 ) / 3;
	    if( temp + 2 <= 10 ) {
		result.add(  new Triplet( temp, temp, temp + 2 ) );		
	    }
	    if( temp + 1 <= 10 ) {
		result.add(  new Triplet( temp, temp + 1, temp + 1 ) );		
	    }
	}
	if( (aSum - 3) % 3 == 0 && (aSum - 3) >= 0) {
	    temp = ( aSum - 3 ) / 3;
	    if( temp + 2 <= 10 ) {
		result.add(  new Triplet( temp, temp + 1, temp + 2 ) );
	    }
	}
	if( (aSum - 4) % 3 == 0 && (aSum - 4) >= 0) {
	    temp = ( aSum - 4 ) / 3;
	    if( temp + 2 <= 10 ) {
		result.add(  new Triplet( temp, temp + 2, temp + 2 ) );
	    }
	}
	return result;
    }
    
    private static Triplet getAboveNotSurprising( Collection<Triplet> aCollection, int aTreshold ) {
	for (Triplet triplet : aCollection ) {
	    if( ( triplet.getBestResult() >= aTreshold ) && !triplet.isSurprising() ) {
		return triplet;
	    }
	    
	}
	return null;
    }

    private static Triplet getBelowNotSurprising( Collection<Triplet> aCollection, int aTreshold ) {
	for (Triplet triplet : aCollection ) {
	    if( ( triplet.getBestResult() < aTreshold ) && !triplet.isSurprising() ) {
		return triplet;
	    }
	    
	}
	return null;
    }
    
    private static Triplet getAboveAndSurprising( Collection<Triplet> aCollection, int aTreshold ) {
	for( Triplet triplet : aCollection ) {
	    if( ( triplet.getBestResult() >= aTreshold ) && triplet.isSurprising() ) {
		return triplet;
	    }
	}
	return null;
    }
    
    private static Triplet getBelowAndSurprising( Collection<Triplet> aCollection, int aTreshold ) {
	for( Triplet triplet : aCollection ) {
	    if( ( triplet.getBestResult() < aTreshold ) && triplet.isSurprising() ) {
		return triplet;
	    }
	}
	return null;
    }

}
