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.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;

public class B {
	Map<String, String> mapLenguaje;

	public static void main(String arg[]) {
		try {
			StringBuffer line;
			
			File file = new File("C:/Documents and Settings/jjmamby/Mis documentos/Descargas/B-small-attempt1.in");
			int T = 0, N = 0, S = 0, maxP, t, bestResult, p;
			StringBuilder output = new StringBuilder();
			if (file.exists()) {
				BufferedReader input = new BufferedReader(new FileReader(file));
				
				T = Integer.valueOf((input.readLine()));
				for (int i = 0; i < T; i++) {
					line = new StringBuffer(input.readLine());
					StringTokenizer st = new StringTokenizer(line.toString(), " ");
					N = Integer.valueOf(st.nextToken());
					S = Integer.valueOf(st.nextToken());
					maxP = Integer.valueOf(st.nextToken());
					p = 0;
					for(int j = 0; j < N; j++){
						t = Integer.valueOf(st.nextToken());
						int aux1 = t / 3 ;
						bestResult = aux1;
						int aux2 = (t - aux1) / 2 ;
						
						if(aux2>bestResult){
							bestResult = aux2;
						}
						int aux3 = (t - aux1 - aux2) ;
						if(aux3>bestResult){
							bestResult = aux3;
						}
												
						if(maxP<=aux3){
							p++;
						}else if (t > 2 && t < 28){
							aux2--;
							aux3++;
							if(maxP<=aux3&& S>0 ){
								S--;
								p++;
							}
						}
					}
					output.append("Case #");
			    	output.append((i+1));
			    	output.append(": ");
			    	output.append(p);
			    	output.append("\n");
				}
				System.out.println(output.toString());
			}else{
				output.append("No hay Archivo");
			}
				
		} catch (Exception e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
}
