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.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.util.LinkedList;
import java.util.Scanner;

public class DancingWiththeGooglers {

	public static void main(String[] args) throws FileNotFoundException {
		 Scanner in = new Scanner(new File("B-small-attempt5.in"));
//		Scanner in = new Scanner(System.in);
		BufferedWriter out = null;
		try {
			FileWriter fstream = new FileWriter("out.txt");
			out = new BufferedWriter(fstream);
			int cases = in.nextInt();
			int N;
			int S;
			int P;
			LinkedList<Integer> googlers;
			for (int i = 0; i < (cases); i++) {
				int result = 0;
				int surprising = 0;
				int canBe = 0;
				N = in.nextInt();
				S = in.nextInt();
				P = in.nextInt();
				googlers = new LinkedList<Integer>();
				for (int j = 0; j < N; j++) {
					int t = in.nextInt();
					// if (t != 0)
					googlers.add(t);
				}
				for (int j = 0; j < googlers.size(); j++) {
					int temp = googlers.get(j) - (3 * P);
					if (temp == -3 || temp == -4) {
						if (googlers.get(j) != 0) {
							surprising++;
						}
					} else if (temp >= -2) {
						result++;
						if (googlers.get(j) != 29 || googlers.get(j) != 30) {
							canBe++;
						}
					}
				}
				int answer = 0;
				int tempo = 0;
				if (S <= surprising) {
					tempo = S;
				} else {
					tempo = surprising;
					// if(tempo<=canBe)
					// answer=result;
					// tempo = Math.abs(tempo - canBe);
				}
//				System.out.println(result + " " + tempo);
				answer = result + tempo;
				out.write("Case #" + (i + 1) + ": " + answer + "\n");
				System.out.println("Case #" + (i + 1) + ": " + answer);
			}
			out.close();
		} catch (Exception e) {// Catch exception if any
		}

	}
}
