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.FileWriter;
import java.util.HashMap;
import java.util.Scanner;
import java.util.logging.Logger;

public class B2012 {
	public static void main(String[] args) throws Exception {
		File f = new File("C:\\gcj\\b_res.txt");
		FileWriter w = new FileWriter(f);
		Scanner sca = new Scanner(new File("C:\\gcj\\b.txt"));
		int T = sca.nextInt();
		for (int i = 0; i < T; i++) {
			int N = sca.nextInt();
			int S = sca.nextInt();
			int p = sca.nextInt();
			int[] t = new int[N];
			int res = 0;
			int puwede = 0;
			for (int j = 0; j < N; j++) {
				t[j] = sca.nextInt();
				if (t[j] >= p * 3 - 2) {
					res++;
				} else if (t[j] >= p * 3 - 4 && p * 3 - 4 > 0) {
					puwede++;
				}
			}
			res += Math.min(puwede, S);
			w.write("Case #" + (i + 1) + ": " + res + "\n");
		}
		w.flush();
		w.close();
	}

}
