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.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class Qual1b {
	static int[] norm = { 0, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6,
			6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10 };
	static int[] weird = { 0, 1, 1, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6,
			7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10, 10 };

	public static void main(String args[]) {

		try {

			FileWriter fstream = new FileWriter("outBSmall1.txt");
			BufferedWriter out = new BufferedWriter(fstream);

			Scanner scanner = new Scanner(new File("B-small-attempt0.in"));

			int count = scanner.nextInt();
			System.out.println(count);
			for (int i = 1; i <= count; i++) {
				int n = scanner.nextInt();
				int s = scanner.nextInt();
				int p = scanner.nextInt();

				System.out.println("googlees " + n);
				System.out.println("surprising " + s);
				System.out.println("max score " + p);

				int resultMax = 0;
				// ArrayList<Integer> listOfNum = new ArrayList<Integer>();
				for (int j = 0; j < n; j++) {
					int temp = scanner.nextInt();
					if (norm[temp] >= p) {
						resultMax++;
					} else if (weird[temp] >= p && s > 0) {
						resultMax++;
						s--;
					}
				}

				out.write("Case #" + i + ": " + resultMax + "\n");
			}
			out.close();

		} catch (Exception e) {
			e.printStackTrace();
		}
	}

}
