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.File;
import java.util.HashMap;
import java.util.Map;
import java.util.Properties;
import java.util.Scanner;

public class B {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws Exception {
		// TODO Auto-generated method stub

		// bug eliminator

		Scanner in = new Scanner(new File("d:\\b.small.in"));// new Scanner(new
															// File("d:\\b.small.in"));
		// in = new Scanner(new File("d:\\Minimum Scalar Product-big.in"));

		int people, surp, max,cutter, dangers, certainty;
		int[] scores;

		int testCases = in.nextInt();
		in.nextLine();
		for (int cas = 1; cas <= testCases; cas++) {

			int ans = 0;

			people = in.nextInt();
			scores = new int[people];
			surp = in.nextInt();
			max = in.nextInt();
			cutter = max*3;

			for (int i = 0; i < people; i++)
				scores[i] = in.nextInt();

//			in.nextLine();// eat linedelim

			dangers = 0;
			certainty = 0;
			for (int i = 0; i < people; i++) {
				if (scores[i] >= cutter - 2) {
					certainty++;
				} else if (scores [i] >= cutter - 4&&cutter - 4>=0) {
					dangers++;
				}
			}
//			System.out.println("m"+max+"c"+cutter+"c"+certainty+"d"+dangers+"s"+surp);
			ans = certainty;
			ans+= dangers > surp ? surp : dangers;

			System.out.printf("Case #%d: %d\n", cas, ans);
		}

	}

}
