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.awt.Container;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;

import javax.swing.JFrame;
import javax.swing.JTextArea;


public class Dancing extends JFrame
{
	private final int WIDTH = 800;
	private final int HEIGHT = 400;
	private Container pane; 
	
	private String[] unformatted;
	private String[] formatted;
	private char[][] formattedCharArray;
	
	private int[] numberOfDancers;
	private int[] numberOfSurprises;
	private int[] theScoreToBeat;
	
	private int[][] theScores;
	private boolean[][] wasNatural;
	
	private int[] numberOfNaturalWinners;
	private int[] numberOfSurprisingWinners;
	private int[] numberOfWinners;
	
	private int numberOfLines;
	
	private int[] naturals = {0, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10}; 
	private int[] surprises = {0, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10, 10};
	
	private JTextArea input, output;
	
	
	
	private Scanner scanner;
	private PrintWriter out;
	
	
	public Dancing() throws IOException
	{
		pane = new Container();
		pane = getContentPane();
		
		scanner = new Scanner(new File("c:/users/Christopher/Desktop/input.in"));
		out = new PrintWriter(new FileWriter("c:/users/Christopher/Desktop/output.out")); 
		
		numberOfLines = Integer.parseInt(scanner.nextLine());
		
		
		unformatted = new String[numberOfLines];
		formatted = new String[numberOfLines];
		
		numberOfDancers = new int[numberOfLines];
		numberOfSurprises = new int[numberOfLines];
		theScoreToBeat = new int[numberOfLines];
		
		numberOfNaturalWinners = new int[numberOfLines];
		numberOfSurprisingWinners = new int[numberOfLines];
		numberOfWinners = new int[numberOfLines];
		
		input = new JTextArea(100, numberOfLines);
		input.setSize(300,200);
		input.setLocation (10, 10);
		
		output = new JTextArea(120, numberOfLines);
		output.setSize(300,200);
		output.setLocation(410, 10);
		
		pane.setLayout(null);
		pane.add(input);
		pane.add(output);
		
		theScores = new int[numberOfLines][];
		wasNatural = new boolean[numberOfLines][];		

		for (int i = 0; i < numberOfLines; i++)
		{
			numberOfDancers[i] = scanner.nextInt();
			numberOfSurprises[i] = scanner.nextInt();
			theScoreToBeat[i] = scanner.nextInt();
			
			input.append(numberOfDancers[i] + " " + numberOfSurprises[i] + " " + theScoreToBeat[i] + " ");
			
			theScores[i] = new int[numberOfDancers[i]];
			wasNatural[i] = new boolean[numberOfDancers[i]];
			
			for (int j = 0; j < numberOfDancers[i]; j++)
			{
				theScores[i][j] = scanner.nextInt();
				if (j < numberOfDancers[i] - 1)
					input.append(theScores[i][j] + " ");
				else
					input.append(theScores[i][j] + "\n");
			}
			
		}
		
		for (int i = 0; i < numberOfLines; i++)
		{
			numberOfWinners[i] = findWinners(i);
			output.append("Case #" + (i + 1) + ": " + numberOfWinners[i] + "\n");
			out.println("Case #" + (i + 1) + ": " + numberOfWinners[i] + "\n");
		}
		
		
		
	/*	for (int i = 0; i < numberOfLines; i++)
		{
			formatted[i] = new String(formattedCharArray[i]);
			formatted[i] = "Case #" + (i + 1) + ": " + formatted[i];
			output.append(formatted[i] + "\n");
			out.println(formatted[i]);
		}
		*/
		
		scanner.close();
		out.close();
		
		setVisible(true);
		setSize(WIDTH, HEIGHT);
		setTitle("Tongues");
		setDefaultCloseOperation(EXIT_ON_CLOSE);
		
		
	}
	
	public static void main(String args[]) throws IOException
	{
		Dancing awesome = new Dancing();
	}
	
	int findWinners(int whichLine)
	{
		
		numberOfSurprisingWinners[whichLine] = 0;
		
		for (int i = 0; i < numberOfDancers[whichLine]; i++)
		{
			if (naturals[theScores[whichLine][i]] >= theScoreToBeat[whichLine])
			{
				numberOfNaturalWinners[whichLine]++;
				wasNatural[whichLine][i] = true;
			}
		}
		
		for (int i = 0; i < numberOfDancers[whichLine]; i++)
		{
			if (surprises[theScores[whichLine][i]] >= theScoreToBeat[whichLine] && wasNatural[whichLine][i] == false)
			{
				numberOfSurprisingWinners[whichLine]++;
			}
		}
		
		
		if (numberOfSurprisingWinners[whichLine] > numberOfSurprises[whichLine])
		{
			numberOfSurprisingWinners[whichLine] = numberOfSurprises[whichLine];
		}
		
		return numberOfNaturalWinners[whichLine] + numberOfSurprisingWinners[whichLine];
	}
}