/**
 * 
 */
package pandit.codejam;

import java.io.BufferedInputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.Scanner;

/**
 * @author Manu Ram Pandit
 * 
 */
public class DancingWithGooglersUpload {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		FileInputStream fStream = new FileInputStream(
				"input.txt");

		Scanner scanner = new Scanner(new BufferedInputStream(fStream));
		Writer out = new OutputStreamWriter(new FileOutputStream("output.txt"));

		int T = scanner.nextInt();
		int N,S,P,ti;
		int counter = 0;
		for (int count = 1; count <= T; count++) {
			N=scanner.nextInt();
			S = scanner.nextInt();
			counter = 0;
			P = scanner.nextInt();
			for(int i=1;i<=N;i++){
				ti=scanner.nextInt();
				if(ti>=(3*P-2)){
					counter++;
					continue;
				}
				else if(S>0){
					if(P>=2 && ((ti==(3*P-3)) ||(ti==(3*P-4)))) {
					S--;
					counter++;
					continue;
					}
				}
				
			}
			// System.out.println("Case #" + count + ": " + counter);
			out.write("Case #" + count + ": " + counter + "\n");
		}
		fStream.close();
		out.close();

	}

}

package gcj;

import java.util.*;
import java.io.*;

public class DancingWithGoogle {
    final static String PROBLEM_NAME = "dance";
    final static String WORK_DIR = "D:\\Gcj\\" + PROBLEM_NAME + "\\";

    static int[][] maxBest = new int[31][2];

    static void preprocess() {
        for (int i=0; i<=30; i++)
            Arrays.fill(maxBest[i], -1);

        for (int A=0; A<=10; A++)
            for (int B=A; B<=10 && B<=A+2; B++)
                for (int C=B; C<=10 && C<=A+2; C++) {
                    int tot = A+B+C, sur = (C - A == 2 ? 1 : 0);
                    maxBest[tot][sur] = Math.max(maxBest[tot][sur], C);
                }
    }

    void solve(Scanner sc, PrintWriter pw) {
        int N = sc.nextInt();
        int S = sc.nextInt();
        int p = sc.nextInt();
        int[] tot = new int[N];
        for (int i=0; i<N; i++)
            tot[i] = sc.nextInt();

        int[][] dp = new int[N+1][N+1];
        for (int i=0; i<=N; i++)
            Arrays.fill(dp[i], -100000);
        dp[0][0] = 0;

        for (int pos=0; pos<N; pos++)
            for (int sur=0; sur <= pos; sur++)
                for (int nSur=0; nSur < 2; nSur++)
                    if (maxBest[tot[pos]][nSur] >= 0)
                        dp[pos+1][sur+nSur] = Math.max(dp[pos+1][sur+nSur], dp[pos][sur] + (maxBest[tot[pos]][nSur] >= p ? 1 : 0));

        pw.println(dp[N][S]);
    }

    public static void main(String[] args) throws Exception {
        preprocess();

        Scanner sc = new Scanner(new FileReader(WORK_DIR + "input.txt"));
        PrintWriter pw = new PrintWriter(new FileWriter(WORK_DIR + "output.txt"));
        int caseCnt = sc.nextInt();
        for (int caseNum=0; caseNum<caseCnt; caseNum++) {
            System.out.println("Processing test case " + (caseNum + 1));
            pw.print("Case #" + (caseNum+1) + ": ");
            new DancingWithGoogle().solve(sc, pw);
        }
        pw.flush();
        pw.close();
        sc.close();
    }
}
