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.*;
public class Main {
	public static void main(String[] args) throws Exception{
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		int cases=Integer.parseInt(in.readLine());
		for(int i=1;i<=cases;i++)
		{
			String line = in.readLine();
			String parts[] = line.split(" ");
			int out = 0;
			int n = Integer.parseInt(parts[0]);
			int s = Integer.parseInt(parts[1]);
			int p = Integer.parseInt(parts[2]);
			int count = 0;
			int marks[] = new int[n];
			for(int j=0;j<n; j++){
				marks[j] = Integer.parseInt(parts[3+j]);
			}
			if(p == 0){
				count = n;
				System.out.println("Case #"+i+": "+count);
				continue;
			}
			else{
				for(int j = 0 ; j < n ; j++){
					if(marks[j] != 0){
						if(marks[j] >= 3*p){
							count++;
							continue;
						}
						else if(marks[j] == ((3*p)-2)){
							count++;
							continue;
						}
						else if(marks[j] == ((3*p)-1)){
							count++;
							continue;
						}
						else if((marks[j] == ((3*p)-3) )||(marks[j] == ((3*p)-4))){
							if(s>0){
								s--;
								count++;
							}
						
						}
						}
					}
					System.out.println("Case #"+i+": "+count);
				}
			}
			
		}

	}


