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.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;


public class GoogleJamQ2 {

	  static int[] triplets = new int[100];
	  static int number_googlers = 0;
	  static int number_surprising = 0;
	  static int least_number = 0;
	
	    
	  
	/**
	 * @param args
	 * @throws IOException 
	 */
	private static void get_numbers(String toCalculate)
	{
		char[] number_to_convert = new char[4];
		int number_got = 0;
		int number_triplets = 0;
		int number_length = 0;
		int str_length = toCalculate.length();
		for(int k = 0; k < str_length; k++)
		{
			number_to_convert[0] = toCalculate.charAt(k);
			number_length ++;
			if(k + 1 < str_length)
			{
				number_to_convert[1] = toCalculate.charAt(k+1);
				k++;
				if(number_to_convert[1] != ' ')
				{
					number_length ++;
					if(k + 1 < str_length)
					{
						number_to_convert[2] = toCalculate.charAt(k+1);
						k++;
						if(number_to_convert[2] != ' ')
						{
							number_length ++;
							k++;
						}
					}

				}
			}

			switch(number_got)
			{
				case 0:
					number_googlers = new Integer(new String(number_to_convert,0,number_length));
					number_got ++;
					break;
				case 1:
					number_surprising = Integer.parseInt(new String(number_to_convert,0,number_length));
					number_got ++;
					break;
				case 2:
					least_number = Integer.parseInt(new String(number_to_convert,0,number_length));
					number_got ++;
					break;
				default:
					triplets[number_triplets] = Integer.parseInt(new String(number_to_convert,0,number_length));
					number_got ++;
					number_triplets ++;
					break;
			}
			number_length = 0;
		}
	}
	
	private static boolean canGreater(int total, int least)
	{
		int single = total / 3;
		int remainer = total % 3;
		if (single >= least)
		{
			return true;
		}
		else
		{

			switch(remainer)
			{
				case 0:
					if(number_surprising > 0)
					{
						if(single == 0)
						{
							//System.out.println(single+", "+single+", "+single);
							return false;
						}
						else if((single + 1) >= least)
						{
							//System.out.println((single-1)+", "+single+", "+(single+1));
							number_surprising --;
							return true;
						}
						else
						{
							return false;
						}
					}
					else
					{
						//System.out.println(single+", "+single+", "+single);
						return false;
					}
					
				case 1:
					if((single + 1) >= least)
					{
						return true;
					}
					else
						return false;
					
				case 2:
					if((single + 1) >= least)
					{
						return true;
					}
					else 
					{
						if((number_surprising > 0))
						{
							if((single + 2) >= least)
							{
								number_surprising --;
								return true;
							}
						}
						else
						{
							return false;
						}

					}
			}
		}
		return false;
	}
	
	
	public static void main(String[] args) throws IOException {
		//System.out.println("Begin cacluating");
		 FileInputStream fstream = new FileInputStream("rec/input.txt");
		  // Get the object of DataInputStream
		  DataInputStream in = new DataInputStream(fstream);
		  BufferedReader br = new BufferedReader(new InputStreamReader(in));
		  String strLine;
		  strLine = br.readLine();
		  int x = Integer.parseInt(strLine);
		  
		  int output_result = 0;

		  for(int i = 0; i < x; i++)
		  {
			  strLine = br.readLine();
			  get_numbers(strLine);
			  //System.out.println("googlers: "+number_googlers+" surprising: "+number_surprising+" least: "+least_number);

			  for(int k = 0; k < number_googlers; k++)
			  {
				  //System.out.println((k+1)+": "+triplets[k]);
				  if(canGreater(triplets[k], least_number))
				  {
					  output_result ++;  
				  }
			  }
			  System.out.println("Case #"+(i+1)+": "+output_result);
			  output_result = 0;
		  }
		  

	}

}

