/**
 * 
 */
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.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfMain {

	public static void main(String[] args) throws FileNotFoundException {
		String file = "B-small-attempt0";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for(int t=1; t<=T; t++){
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			
			int[] scores = new int[N];
			int[] bst = new int[N];
			int[] dmax = new int[N];
			
			int nextp=0;
			int prevp=0;
			for(int i=0; i < scores.length; i++){
				int s = scores[i] = in.nextInt();
				if(s%3==0){
					bst[i]=s/3;
					dmax[i] = bst[i]>0?1:0;
				}else if(s%3 ==1){
					bst[i]=s/3 + 1;
					dmax[i] = 0;
				}else{
					bst[i]=s/3 + 1;
					dmax[i] = 1;
				}
				
				if(bst[i]>=p)
					nextp++;
				if(bst[i]==p-1&& dmax[i]>0)
					prevp++;
			}			
			out.println("Case #" + t + ": "+(nextp+Math.min(S, prevp)));//+Math.min(S, prevp));			
		}
		
		
		in.close();
		out.close();
	}
}
