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.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Arrays;
import java.util.Scanner;

public class B {

	/**
	 * @param args
	 * @throws IOException
	 */
	public static void main(String[] args) throws IOException {
		// BufferedReader read = new BufferedReader(new InputStreamReader(
		// new FileInputStream(
		// "C:/Users/Ortiga/Downloads/B-small-attempt0.in")));

		BufferedWriter write = new BufferedWriter(new OutputStreamWriter(
				new FileOutputStream("C:/Users/Ortiga/Downloads/outputB.txt")));
		Scanner sc = new Scanner(new InputStreamReader(new FileInputStream(
				"C:/Users/Ortiga/Downloads/B-small-attempt1.in")));
		byte length = sc.nextByte();
		for (byte i = 0; i < length; i++) {
			byte t = sc.nextByte(), s = sc.nextByte(), p = sc.nextByte(), max = 0, getDuringSurp = 0;
			String rit = "Case #" + (i + 1) + ": ";
			byte[] t_i = new byte[t];
			for (byte j = 0; j < t; j++)
				t_i[j] = sc.nextByte();
			Arrays.sort(t_i);
			int sCounter = 0;
			for (byte j = 0; j < t; j++) {
				byte currT_i = t_i[j];
				if (currT_i == 0 && p > 0)
					continue;
				if (sCounter < s) {
					if ((currT_i - 2) % 3 == 0) {
						if ((((currT_i - 2) / 3) + 2 >= p)) {
							max++;
							getDuringSurp++;
						}
						sCounter++;
						continue;
					} else if ((currT_i - 3) % 3 == 0) {
						if ((((currT_i - 3) / 3) + 2 >= p)) {
							max++;
							getDuringSurp++;
						}
						sCounter++;
						continue;
					}
				}
				if ((currT_i - 1) % 3 == 0) {
					if ((((currT_i - 1) / 3) + 1 >= p))
						max++;
					else if (currT_i + 4 / 3 >= p && getDuringSurp < sCounter) {
						sCounter--;
						j--;
					}
				} else if ((currT_i - 2) % 3 == 0) {
					if ((((currT_i - 2) / 3) + 1 >= p))
						max++;
					else if (currT_i + 4 / 3 >= p && getDuringSurp < sCounter) {
						sCounter--;
						j--;
					}
				} else {
					if (currT_i / 3 >= p)
						max++;
					else if (currT_i + 4 / 3 >= p && getDuringSurp < sCounter) {
						sCounter--;
						j--;
					}
				}
			}
			rit += max;
			write.write(rit);
			if (i < length - 1)
				write.newLine();
		}
		sc.close();
		write.close();
	}
}
