import java.util.List;


public class Case implements Runnable {

	private int id;
	private String output;

	private int n;
	private int s;
	private int p;
	private List<Integer> g;

	public Case(int id) {
		this.id = id;
	}

	public Case(int id, int n, int s, int p, List<Integer> g) {
		super();
		this.id = id;
		this.n = n;
		this.s = s;
		this.p = p;
		this.g = g;
	}

	public String solve() {
		int res = 0;
		for (int googler : g) {
			int b = googler / 3;
			boolean div = googler % 3 == 0;
			if (b >= p) {
				res++;
				continue;
			}
			if (p == b+1) {
				if (div && s > 0 && b > 0) {
					res++;
					s--;
					continue;
				}
				if (!div) {
					res++;
					continue;
				}
			}
			if (p == b+2) {
				if (3*b+2 == googler && s > 0) {
					res++;
					s--;
				}
			}
		}
		return String.valueOf(res);
	}

	@Override
	public void run() {
		output = solve();
	}

	@Override
	public String toString() {
		return "Case #" + id + ": " + output;
	}

}
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;


public class Dancing {

	public static void main(String args[]) throws IOException{
		// Setup the input
				File f1 = new File("B-small-attempt0.in");
				Scanner s1 = new Scanner(f1);
				// setup the output:
				PrintWriter out = new PrintWriter(new FileWriter("output.out"));
				
				// getting the number of test cases and getting rid of the line
				int testCases = Integer.parseInt(s1.nextLine());
				//System.out.println(testCases);
				
				// setting up some vars
				int googlers;
				int surprising;
				int testMax;
				ArrayList<Integer> scores = new ArrayList<Integer>();
				int j = 0;
				int resultNum;
				int surprisingLeft;
				// Loop over the lines
				while(s1.hasNextLine()){
					scores.clear();
					resultNum = 0;
					j++;
					googlers = s1.nextInt();
					surprising = s1.nextInt();
					surprisingLeft = surprising;
					testMax = s1.nextInt();
					for (int i = 0; i <googlers;i++){
						scores.add(s1.nextInt());
					}
					//System.out.println("Line "+j+" Googlers: " + googlers + " surprising: "+surprising+" testMax: " + testMax);
					// loop over all the googlers
					for (int k = 0; k<googlers;k++){
						//System.out.println(k);
						//int minScore = (testMax-1)+(testMax-1)+(testMax-1);
						//System.out.println(minScore);
						if (scores.get(k)>((testMax-1)+(testMax-1)+(testMax-1))){
							resultNum++;
						}
						else if (surprisingLeft != 0 && scores.get(k)!=0){
							if (scores.get(k)>=testMax+testMax-2+testMax-2){
								resultNum++;
								surprisingLeft--;
							}
							
						}
					}
					out.println("Case #"+j+": "+resultNum);
				}				
				// close the scanner
				s1.close();
				out.close();
	}
}
