package com.silverduner.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashMap;

public class Dancing {
	public static void main(String[] args) throws Exception {
		File input = new File("B-small-attempt0.in");
		BufferedReader in = new BufferedReader(new FileReader(input));

		File output = new File("1.out");
		BufferedWriter out = new BufferedWriter(new FileWriter(output));

		// parse input
		int N = Integer.parseInt(in.readLine());
		for(int i=0;i<N;i++) {
			String str = in.readLine();
			out.write("Case #"+(i+1)+": ");
			System.out.println("-------");
			String[] words = str.split(" ");
			int n = Integer.parseInt(words[0]);
			int suprise = Integer.parseInt(words[1]);
			int threshold = Integer.parseInt(words[2]);
			int[] scores = new int[n];
			for(int j=0;j<n;j++) {
				scores[j] = Integer.parseInt(words[3+j]);
			}
			int count = 0;
			for(int score : scores) {
				int a,b,c;
				boolean find = false;
				boolean sfind = false;
				for(a = 10; a>=0 && !find; a--) {
					if(3*a-4>score)
						continue;
					for(b = a; b>=0 && b >=a-2 && !find; b--) {
						for(c = b; c>=0 && c >=b-2 && c >=a-2 && !find; c--) {
							System.out.println(a+","+b+","+c);
							if(a+b+c==score) {
								if(a >= threshold) {
									if(a-c <= 1){
										count++;
										find = true;
										System.out.println("find!");
									}
									else if(a-c == 2){
										sfind = true;
										System.out.println("suprise!");
									}
								}
							}
							
						}
					}
				}
				if(!find && sfind && suprise > 0)
				{
					count++;
					suprise --;
				}
			}
			int maxCount = count;
			out.write(maxCount+"\n");
		}
		out.flush();
		out.close();
		in.close();
	}
}

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

public class Dancing {

    public static void main(String[] args) {
        try {
            BufferedReader in = new BufferedReader(new FileReader("B-small-attempt0.in"));
            PrintWriter out = new PrintWriter(new FileWriter("B-small-attempt0.out"));

            Integer cases = Integer.valueOf(in.readLine().trim());
            for (int i = 0; i < cases; i++) {
                StringTokenizer st = new StringTokenizer(in.readLine().trim());
                int dancers = Integer.valueOf(st.nextToken().trim());
                int surprising = Integer.valueOf(st.nextToken().trim());
                int minScore = Integer.valueOf(st.nextToken().trim());
                int[] scoreTotals = new int[dancers];
                for (int j = 0; j < scoreTotals.length; j++) {
                    scoreTotals[j] = Integer.valueOf(st.nextToken().trim());
                }
                int maxDancers = solve(surprising, 0, minScore, scoreTotals, 0);
                out.println(String.format("Case #%d: %d", i+1, maxDancers));
            }

            out.close();
            in.close();
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    public static int solve(int maxSurprising, int numSurprising, int minScore, int[] scoreTotals, int totalIndex) {
        int maxDancers = 0;
        if (totalIndex < scoreTotals.length) {
            int totalScore = scoreTotals[totalIndex];
            for (int i = (int)Math.ceil(totalScore/3); i <= (int)Math.min(totalScore,Math.ceil((totalScore+4)/3)); i++) {
                for (int j = Math.max(i-2,0); j <= i; j++) {
                    int k = totalScore - i - j;
                    if ((i - k > 2) || (i - k < 0)) continue;
                    boolean isSurprising = Math.abs(i - j) == 2 || Math.abs(i - k) == 2 || Math.abs(j - k) == 2;
                    if (isSurprising && maxSurprising == numSurprising) continue;
                    int dancers = (i >= minScore ? 1 : 0) + solve(maxSurprising, numSurprising + (isSurprising ? 1 : 0), minScore, scoreTotals, totalIndex+1);
                    maxDancers = Math.max(maxDancers, dancers);
                }
            }
        }
        return maxDancers;
    }
}
