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.io.FileNotFoundException;
import java.util.*;

public class Main {

	/**
	 * @param args
	 * @throws FileNotFoundException
	 */
	public static void main(String[] args) throws FileNotFoundException {
		// TODO Auto-generated method stub
		Scanner scan = new Scanner(new File("in"));

		scan.nextLine();// removes int at start

		int counter = 0;

		while (scan.hasNextInt()) {
			
			counter++;
			
			// initialize
			int numDancers = scan.nextInt();
			int numSurp = scan.nextInt();
			int best = scan.nextInt();

			int[] dancers = new int[numDancers];

			for (int i = 0; i < numDancers; i++) {
				dancers[i] = scan.nextInt();
			}

			// do the checks
			
			if (best==0) {
				System.out.println("Case #"+counter+": "+numDancers);
				
			}
			else if (best==1){
				int cnt = 0;
				for (int i = 0; i < numDancers; i++){
					if (dancers[i]!=0) {
						cnt++;
					}
				}
				System.out.println("Case #"+counter+": "+cnt);
			}
			else{

			int count1 = 0, count2 = 0;

			for (int i = 0; i < numDancers; i++) {
				int score = dancers[i];
				if (score >= 3 * best - 2 && 3*best - 2>=0) {
					count1++;
				} else if (score >= 3 * best - 4 && 3*best-4>=0) {
					count2++;
				}
			}

			if (count2 <= numSurp) {
				System.out.println("Case #"+counter+": "+ (int)(count1 +count2));
			}
			else{
				System.out.println("Case #"+counter+": "+ (int)(count1+numSurp));
			}

		}

	}
	}

}
