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.*;
import java.util.*;

public class dancers
{
	public static void main(String[] args)
	{
		ArrayList<HashSet<triple>> list = new ArrayList<HashSet<triple>>();
		for (int i = 0; i <= 30; i++)
		{
			HashSet<triple> temp = new HashSet<triple>();
			list.add(temp);
		}
		for (int i = 0; i <= 10; i++)
			for (int j = 0; j <= 10; j++)
				for (int k = 0; k <= 10; k++)
				{
					if (!((Math.abs(i - j) > 2) || (Math.abs(i - k) > 2) || (Math.abs(j - k) > 2)))
					{
						triple temp = new triple(i, j, k);
						HashSet<triple> temp2 = list.get(temp.total);
						boolean found = false;
						for (triple t : temp2)
						{
							if (t.theset.equals(temp.theset))
							{
								found = true;
								break;
							}
						}
						if (!found) temp2.add(temp);
						list.set(temp.total, temp2);
					}
				}

		/*
		 * //System.out.println(list); for (HashSet<triple> h : list) {
		 * //System.out.println(h.size()); }
		 */

		try
		{
			FileReader fread = new FileReader(new File("B-small-attempt4.in"));
			BufferedReader br = new BufferedReader(fread);
			FileWriter fwrite = new FileWriter(new File("output.txt"));
			PrintWriter pw = new PrintWriter(fwrite);
			int cases = new Integer(br.readLine());
			for (int i = 1; i <= cases; i++)
			{
				String line = br.readLine();
				StringTokenizer st = new StringTokenizer(line);

				int googlers = new Integer(st.nextToken());
				int s = new Integer(st.nextToken());
				int p = new Integer(st.nextToken());

				int[] googlerscores = new int[googlers];

				for (int j = 0; j < googlers; j++)
				{
					googlerscores[j] = new Integer(st.nextToken());
				}

				// for (int a : googlerscores)
				// System.out.println(a);

				int fors[] = new int[googlers];
				int fornos[] = new int[googlers];

				for (int j = 0; j < googlers; j++)
				{
					fors[j] = 0;
					fornos[j] = 0;
				}

				int counts = 0;
				int countnos = 0;
				for (int j = 0; j < googlers; j++)
				{
					HashSet<triple> scores = list.get(googlerscores[j]);
					for (triple s1 : scores)
					{
						// System.out.println(s1);
						if (s1.p >= p)
						{
							if (s1.state == 2)
							{
								fors[j] = s1.p;
								counts++;
								// //System.out.println("counts=" + counts);
							}
							else
							{
								fornos[j] = s1.p;
								countnos++;
								// //System.out.println("countnos=" + countnos);
							}
						}
					}
				}
				// System.out.println("s=" + s);
				for (int d : fors)
				{
					// System.out.print(d + ",");
				}
				// System.out.println();

				for (int d : fornos)
				{
					// System.out.print(d + ",");
				}
				// System.out.println();
				int count = 0;
				
				if ((s == 3) && (counts == 3)) count = 3;
				else if (s == 2)
				{
					if ((googlers == 2) && (counts == 2)) count = 2;
					else if ((googlers == 3) && (counts >= 2))
					{
						int check = 0;
						if (fors[0] > 0 && fors[1] > 0)
						{
							check = 2;
							if (fornos[2] > 0) check = 3;
						}
						// 12

						if (fors[1] > 0 && fors[2] > 0)
						{
							check = Math.max(check, 2);
							if (fornos[0] > 0) check = Math.max(check, 3);
						}

						// 23
						if (fors[0] > 0 && fors[2] > 0)
						{
							check = Math.max(check, 2);
							if (fornos[1] > 0) check = Math.max(check, 3);
						}

						// 13
						count = check;
					}
				}
				else if (s == 1)
				{
					if (counts >= 1)
					{
						if (googlers == 1)
						{
							count = 1;
						}
						else if (googlers == 2)
						{
							if (fors[0] > 0)
							{
								count = 1;
								if (fornos[1] > 0) count = 2;
							}
							if (fors[1] > 0)
							{
								count = Math.max(count, 1);
								if (fornos[0] > 0) count = Math.max(count, 2);
							}
						}
						else if (googlers == 3)
						{
							if (fors[0] > 0)
							{
								int check = 1;
								if (fornos[1] > 0) check++;
								if (fornos[2] > 0) check++;
								count = Math.max(count, check);
							}
							if (fors[1] > 0)
							{
								int check = 1;
								if (fornos[0] > 0) check++;
								if (fornos[2] > 0) check++;
								count = Math.max(count, check);
							}
							if (fors[2] > 0)
							{
								// System.out.println("in here");
								int check = 1;
								if (fornos[0] > 0) check++;
								if (fornos[1] > 0) check++;
								count = Math.max(count, check);
							}

						}
					}
				}
				else
				{
					count = countnos;
				}
				pw.println("Case #" + i + ": " + count);
				// System.out.println("Case #" + i + ": " + count);
			}
			pw.close();
		}
		catch (FileNotFoundException e)
		{
			e.printStackTrace();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}

	}
}
