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.*;

public class DancingGooglers {
	private static final String IN_FILE = "B-small.in";
	private static final String OUT_FILE = "B-small_output.txt";
	
	public static void main(String[] args) {
		try {
			BufferedReader br = new BufferedReader(new FileReader(IN_FILE));
			BufferedWriter bw = new BufferedWriter(new FileWriter(OUT_FILE));
			String line = br.readLine();
			final int T_CASES = Integer.parseInt(line);
			
			for (int t = 1; t <= T_CASES; t++) {
				line = br.readLine();
				String parts[] = line.split(" ");
				final int N = Integer.parseInt(parts[0]);	// number of Googlers
				final int S = Integer.parseInt(parts[1]);	// number of surprising triplets of scores
				final int P = Integer.parseInt(parts[2]);	// best result of at least p
				
				int[] totalPoints = new int[N];
				for (int i = 0; i < N; i++) {
					totalPoints[i] = Integer.parseInt(parts[i + 3]);
				}
				
				int result = processCase(N, S, P, totalPoints);
				bw.write("Case #" + t + ": " + result);
				bw.newLine();
			}
			
			bw.close();
			br.close();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}
	
	private static int processCase(int n, int s, int p, int[] totalPoints) {
		int result = 0;
		
		for (int t : totalPoints) {
			switch (p) {
			case 0:
				result++;
				break;
			case 1:
				if (t >= 1) {
					result++;
				}
				break;
			default:
				// p is between 2 to 10
				if (t >= 3 * p - 2) {
					result++;
				} else if (s > 0 && t >= 3 * p - 4) {
					s--;
					result++;
				}
				break;
			}
		}
		
		return result;
	}
	
}
