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.FileReader;
import java.io.FileWriter;
import java.io.PrintStream;
import java.io.PrintWriter;

public class Dancing {

	static PrintStream O = System.out;

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		try {
			PrintWriter out = new PrintWriter(new FileWriter("b.out"));
			BufferedReader in = new BufferedReader(new FileReader("B-small-attempt0.in"));
			int cases = Integer.parseInt(in.readLine());
			for (int kase = 0; kase < cases; kase++){
				String input = in.readLine();
				String[] arr = input.split(" ");
				int N = Integer.parseInt(arr[0]);
				int S = Integer.parseInt(arr[1]);
				int p = Integer.parseInt(arr[2]);
				int[] t = new int [arr.length - 3];
				for (int i = 0; i < t.length; i++){
					t[i] = Integer.parseInt(arr[i + 3]);
				}
				
				int pastMax = 0;
				for (int i = 0; i < t.length; i++){
					if (findMax(t[i]) >= p){
						pastMax++;
					}else if (S > 0 && findSMax(t[i]) >= p){
						pastMax++;
						S--;
					}
				}
				out.println("Case #" + (kase + 1) + ": " + pastMax);
			}
			out.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
	
	static int findMax (int sum){
		if (sum == 0){
			return 0;
		}else if (sum == 1){
			return 1;
		}else if (sum == 2){
			return 1;
		}else if (sum == 3){
			return 1;
		}else if (sum == 4){
			return 2;
		}
		return (sum + 2) / 3;
	}
	
	static int findSMax (int sum){
		if (sum == 0){
			return 0;
		}else if (sum == 1){
			return 1;
		}else if (sum == 2){
			return 2;
		}else if (sum == 3){
			return 2;
		}else if (sum == 4){
			return 2;
		}else if (sum == 5){
			return 3;
		}
		return (sum + 4) / 3;
	}

}
