/**
 * 
 */
package pandit.codejam;

import java.io.BufferedInputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.Scanner;

/**
 * @author Manu Ram Pandit
 * 
 */
public class DancingWithGooglersUpload {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		FileInputStream fStream = new FileInputStream(
				"input.txt");

		Scanner scanner = new Scanner(new BufferedInputStream(fStream));
		Writer out = new OutputStreamWriter(new FileOutputStream("output.txt"));

		int T = scanner.nextInt();
		int N,S,P,ti;
		int counter = 0;
		for (int count = 1; count <= T; count++) {
			N=scanner.nextInt();
			S = scanner.nextInt();
			counter = 0;
			P = scanner.nextInt();
			for(int i=1;i<=N;i++){
				ti=scanner.nextInt();
				if(ti>=(3*P-2)){
					counter++;
					continue;
				}
				else if(S>0){
					if(P>=2 && ((ti==(3*P-3)) ||(ti==(3*P-4)))) {
					S--;
					counter++;
					continue;
					}
				}
				
			}
			// System.out.println("Case #" + count + ": " + counter);
			out.write("Case #" + count + ": " + counter + "\n");
		}
		fStream.close();
		out.close();

	}

}

import java.io.*;
import java.util.StringTokenizer;

public class DancingWiththeGooglers {
	public static void main(String[] args) {
		try {
			BufferedReader ifStream = new BufferedReader(new FileReader("B.in"));
			PrintWriter ofStream = new PrintWriter(new FileWriter("B.out"));
			int numCase = Integer.parseInt(ifStream.readLine());

			for (int i=1; i<=numCase; i++) {
				ofStream.println("Case #"+i+": "+dancingWiththeGooglers(ifStream.readLine()));
			}

			ifStream.close();
			ofStream.close();
		}
		catch (IOException e) {
			System.out.println("IOException.");
		}
	}

	private static int dancingWiththeGooglers(String input) {
		StringTokenizer st = new StringTokenizer(input, " ", false);
		int numGooglers = Integer.parseInt(st.nextToken());
		int S = Integer.parseInt(st.nextToken());
		int p = Integer.parseInt(st.nextToken());
		Googler[] Googlers = new Googler[numGooglers];
		int result = 0;
		int count = 0;

		for (int i=0; i<numGooglers; i++) {
			Googlers[i] = new Googler(Integer.parseInt(st.nextToken()));
			if (Googlers[i].best >= p) {
				result++;
			}
			if (Googlers[i].best == (p-1) && Googlers[i].remainder != 1 && Googlers[i].total != 0 && Googlers[i].total != 29 && Googlers[i].total != 30) {
				count++;
			}
		}

		if (count >= S) {
			result += S;
		}
		else {
			result += count;
		}

		return result;
	}
}

class Googler {
	int total;
	int remainder;
	int best;

	public Googler(int total) {
		this.total = total;
		this.remainder = total % 3;
		int n = total / 3;
		switch (remainder) {
			case 0: best = n; break;	// This is an intermediate value.
			case 1: best = n + 1; break;
			case 2: best = n + 1; break;	// So is this.
		}
	}
}
