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);
        }
    }
}

/*
 * Created on Apr 14, 2012
 *
 */
package com.codejam.y2k12.qualification;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Arrays;
import java.util.Scanner;

/**
 * @author manveer
 * 
 */
public class DancingGooglers
{
    public static boolean isSurprising(int[] scores)
    {
        int a = scores[0], b = scores[1], c = scores[2];
        if (Math.abs(a - b) == 2)
            return true;
        if (Math.abs(c - b) == 2)
            return true;
        if (Math.abs(a - c) == 2)
            return true;
        return false;
    }

    public static int[][] getPossibleScores(int total)
    {
        // 3 --> (1,1,1), (0,1,2)
        // 4 --> (1,1,2), (0,2,2)
        // 5 --> (1,2,2), (1,1,3)
        int[][] result = new int[2][3];
        int first[] = new int[3];
        int second[] = new int[3];
        result[0] = first;
        result[1] = second;
        if(total <= 1)
        {
            first[0] = 0; first[1] = 0; first[2] = total;
            second[0] = 0; second[1] = 0; second[2] = total;
            return result;
        }
        int base = total / 3;
        if (total % 3 == 0)
        {
            first[0] = base;
            first[1] = base;
            first[2] = base;

            second[0] = base - 1;
            second[1] = base;
            second[2] = base + 1;

        }
        else if (total % 3 == 1)
        {
            first[0] = base;
            first[1] = base;
            first[2] = base + 1;

            second[0] = base - 1;
            second[1] = base + 1;
            second[2] = base + 1;
        }
        else
        {
            first[0] = base;
            first[1] = base + 1;
            first[2] = base + 1;

            second[0] = base;
            second[1] = base;
            second[2] = base + 2;
        }
        //System.out.println("Score : " + total + " " + Arrays.toString(result[0]) + " " + Arrays.toString(result[1]));
        return result;
    }

    public static boolean isAcceptableResult(int[] result, int p)
    {
        for (int i = 0; i < result.length; i++)
        {
            if (result[i] >= p)
                return true;
        }
        return false;
    }

    public static int findMaxGooglers(int[] scores, int s, int p, int current)
    {
        if(current >= scores.length)
            return 0;
        //System.out.println("Current: " + current);
        int currScore = scores[current];
        int[][] results = getPossibleScores(currScore);
        boolean isFirstAcceptable = isAcceptableResult(results[0], p);
        boolean isFirstSurprising = isSurprising(results[0]);
        boolean isSecondAcceptable = isAcceptableResult(results[1], p);
        boolean isSecondSurprising = isSurprising(results[1]);
        boolean canTakeFirst = true;
        boolean canTakeSecond = true;
        if (s <= 0 && isFirstSurprising)
        {
            canTakeFirst = false;
        }
        if (s <= 0 && isSecondSurprising)
        {
            canTakeSecond = false;
        }
        int firstPath = 0, secondPath = 0;
        if (canTakeFirst)
        {
            firstPath = (isFirstAcceptable ? 1 : 0);
            //if(firstPath == 1)
              //  System.out.println(Arrays.toString(results[0])) ;
            int sFirst = (isFirstSurprising ? s - 1 : s);
            firstPath += (findMaxGooglers(scores, sFirst, p, current + 1));
        }
        if (canTakeSecond)
        {
            secondPath = (isSecondAcceptable ? 1 : 0);
            //if(secondPath == 1)
             //   System.out.println(Arrays.toString(results[1]));
            int sSecond = (isSecondSurprising ? s - 1 : s);
            secondPath += (findMaxGooglers(scores, sSecond, p, current + 1));
        }
        return Math.max(firstPath, secondPath);
    }

    public static void main(String args[]) throws FileNotFoundException
    {
        Scanner scan = new Scanner(new File(args[0]));
        int T = Integer.parseInt(scan.nextLine());
        for (int i = 1; i <= T; i++)
        {
            int N = scan.nextInt();
            int S = scan.nextInt();
            int p = scan.nextInt();
            int scores[] = new int[N];
            for (int j = 0; j < N; j++)
            {
                scores[j] = scan.nextInt();
            }
            //System.out.println(Arrays.toString(scores) + " " + p);
            scan.nextLine();
            int result = findMaxGooglers(scores, S, p, 0);
            System.out.println("Case #" + i + ": " + result);
        }
    }
}
