/**
 * 
 */
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.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;


public class dancing {

	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	static StringTokenizer st = new StringTokenizer("");

	public static String next() throws Exception {
		while (true) {
			if (st.hasMoreTokens())
				return st.nextToken();
			String s = br.readLine();
			if (s == null)
				return null;
			st = new StringTokenizer(s);
		}
	}

	public static int nextInt() throws Exception {
		return Integer.parseInt(next());
	}
	
	
	public static void main(String[] args) throws Exception {
	
		int T = nextInt();
		
		for(int t = 1 ; t <= T ; t++){
			int N = nextInt();
			int S = nextInt();
			int p = nextInt();
			
			
			int count = 0;
			
			for(int i = 0 ; i < N ; i ++){
				int x = nextInt();
				if(x==0){
					if(p==0)
						count++;
					continue;
				}
				if(x==1){
					if(p<=1)
						count++;
					continue;
				}
				
				if(x % 3 == 0){
					if(x/3 >= p){
						count++;
					}else if(S>0&&x/3 + 1 >= p){
						count ++;
						S--;
					}
				}else if(x%3 == 1){
					if(x/3 +1>= p){
						count++;
					}
				}else {
					if(x/3+1 >= p){
						count++;
					}else if(S>0&&x/3 +2 >= p){
						count ++;
						S--;
					}
				}
			}
			System.out.println("Case #"+t+": "+count);
		}
		
	}
}
