import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

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));
			}

		}

	}
	}

}
