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.BufferedReader;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.IOException;
import java.io.OutputStreamWriter;


public class DancingGooglers {

    /**
     * Google Code Jam 2012: Problem B. Dancing With the Googlers
     * @author hullarb
     * @param args
     * @throws IOException 
     * @throws NumberFormatException 
     */
    public static void main(String[] args) throws NumberFormatException, IOException {
	BufferedReader input = new BufferedReader(new FileReader(args[0]));
	OutputStreamWriter out = new OutputStreamWriter(new FileOutputStream(args[0].contains("in")?args[0].replace("in", "out"):args[0] + ".out"));
	int testCases = Integer.parseInt(input.readLine());
	for(int i = 0; i < testCases; i++) {
	    String[] parts = input.readLine().split(" ");
	    int N = Integer.parseInt(parts[0]);
	    int S = Integer.parseInt(parts[1]), p = Integer.parseInt(parts[2]);
	   // System.out.println("N: " + N + " S: " + S + " p: " +p);
	    int t[] = new int[N];
	    int bests[] = new int[N];
	    for(int j = 0; j < N; j++) {
		t[j] = Integer.parseInt(parts[3 + j]);
		bests[j] = notSurp(t[j]);
		//System.out.println("NotSurp(" +t[j] + "): " + bests[j]);
	    }
	    for(int j = 0; j < N; j++) {
		if(S == 0)
		    break;
		if((t[j] > 1 && t[j] < 29) && (bests[j] == -1 ||
			bests[j] < p)) {
		    int ns = surp(t[j]);
		    //System.out.println("Surp(" +t[j] + "): " + ns);
		    if(bests[j] == -1 && ns == -1) {
			System.err.print("Something went wrong with t: " + t[j]);
		    	continue;
		    }
		    if(ns >= p) {
			bests[j] = ns;
			S--;
		    }else{
			if(bests[j] == -1){
			    S--;
			}
		    }		    
		}
	    }
	    int result = 0;
	    for(int j = 0; j < N; j++)
		if(bests[j] >= p)
		    result++;
	    out.write("Case #" + (i + 1) + ": " + result + "\n");
	}
	out.close();
	input.close();
    }

    private static int surp(int i) {
	if(i == 2)
	   return 2;
	if((i - 2) % 3 == 0)
	    return (i - 2) / 3 + 2;
	if((i - 3) % 3 == 0)
	    return (i - 3) / 3 + 2;
	if(i > 3 && (i - 4) % 3 == 0)
	    return (i - 4) / 3 + 2;
	return -1;
    }

    private static int notSurp(int i) {
	if(i == 0)
	    return 0;
	if(i < 3 )
	    return 1;
	if((i - 2) % 3 == 0)
	    return (i - 2) / 3 + 1;
	if((i - 1) % 3 == 0)
	    return (i - 1) / 3 + 1;
	if(i % 3 == 0)
	    return i / 3;
	return -1;
    }

}
