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

package gcj;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.util.Arrays;

public class DancingWithGooglers 
{
	boolean[][] isPossibleNormal;
	boolean[][] isPossibleSurprising;
	
	int P;
	int[] totalPoints;
	int N;
	int[][] memo;
	
	public DancingWithGooglers()
	{
		this.isPossibleNormal=new boolean[31][11];
		this.isPossibleSurprising=new boolean[31][11];
		for(int i=0;i<31;++i)
		{
			Arrays.fill(isPossibleNormal[i],false);
			Arrays.fill(isPossibleSurprising[i],false);
		}
		for(int a=0;a<=10;++a)
		{
			for(int b=0;b<=10;++b)
			{
				for(int c=0;c<=10;++c)
				{
					int total=a+b+c;
					int best=Math.max(a, b);
					best=Math.max(best, c);
					int maxDiff=Math.max(0,Math.abs(a-b));
					maxDiff=Math.max(maxDiff,Math.abs(b-c));
					maxDiff=Math.max(maxDiff,Math.abs(a-c));					
					if(maxDiff>2)
						continue;
					else if(maxDiff==2)
					{
						isPossibleSurprising[total][best]=true;
					}
					else
					{
						isPossibleNormal[total][best]=true;
					}					
				}
			}
		}
	}
	
	private int solve(int idx,int surpriseLeft)
	{
		if(idx>=N)
		{
			if(surpriseLeft==0)
				return 0;
			else
				return -2;			
		}
		else if(memo[idx][surpriseLeft]!=-1)
			return memo[idx][surpriseLeft];
		else
		{
			int ret=Integer.MIN_VALUE,t1=ret,t2=ret, t3=ret,t4=ret;
			boolean goNormal=false, goSurprising=false;
			for(int possi=P;possi<=10;++possi)
			{
				if(isPossibleNormal[totalPoints[idx]][possi])
					goNormal=true;
				if(isPossibleSurprising[totalPoints[idx]][possi])
					goSurprising=true;
			}
			if(goNormal)
			{
				int t=solve(idx+1,surpriseLeft);
				if(t!=-2)
					t1=1+t;
			}
			if(goSurprising && surpriseLeft>0)
			{
				int t=solve(idx+1,surpriseLeft-1);
				if(t!=-2)
					t2=1+t;
			}			
			{
				//ignore current idx and then not alter surpriseLeft
				int t=solve(idx+1,surpriseLeft);
				if(t!=-2)
					t3=t;
			}
			if(surpriseLeft>0)
			{
				int t=solve(idx+1,surpriseLeft-1);
				if(t!=-2)
				{
					t4=t;
				}
			}
			ret=Math.max(ret,t1);
			ret=Math.max(ret,t2);
			ret=Math.max(ret,t3);
			ret=Math.max(ret,t4);
			if(ret==Integer.MIN_VALUE)
				ret=-2;
			memo[idx][surpriseLeft]=ret;
			return ret;
		}
	}
	private int getMaximumGooglers(int N,int S,int P, int[] totalPoints)
	{
		this.N=N;
		this.P=P;
		this.totalPoints=totalPoints;
		this.memo=new int[N+1][N+1];
		for(int i=0;i<=N;++i)
			Arrays.fill(memo[i],-1);
		int ret=solve(0,S);
		return ret;
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) throws Exception 
	{
		BufferedReader br=null;
		if(args.length>=1)
			br=new BufferedReader(new FileReader(new File(args[0])));
		else
			br=new BufferedReader(new InputStreamReader(System.in));
		if(args.length>=2)
			System.setOut(new PrintStream(new FileOutputStream(args[1])));
		int T=Integer.valueOf(br.readLine().trim());
		DancingWithGooglers obj=new DancingWithGooglers();
		for(int t=1;t<=T;++t)
		{
			String[] tok=br.readLine().trim().split(" ");
			int N=Integer.valueOf(tok[0]);
			int S=Integer.valueOf(tok[1]);
			int P=Integer.valueOf(tok[2]);
			int[] totalPoints=new int[N];
			for(int j=0;j<N;++j)
				totalPoints[j]=Integer.valueOf(tok[3+j]);
			int ret=obj.getMaximumGooglers(N, S, P, totalPoints);
			System.out.println("Case #"+t+": "+ret);
		}
		br.close();

	}

}