/**
 * Created by IntelliJ IDEA.
 * User: Administrator
 * Date: 3/3/12
 * Time: 11:00 AM
 * To change this template use File | Settings | File Templates.
 */

import SRMLib.MathLibrary;
import SRMLib.TestSRMLib;
import com.sun.org.apache.bcel.internal.generic.F2D;

import java.io.*;
import java.util.*;
import java.util.zip.Inflater;

public class SRM {
    public static void main(String[] args) throws IOException {
        //TestSRMLib.run();
        codeJam1.main();

        return;
    }
}
class codeJam1 {
    public static void main() throws IOException {
        String inputPath = "E:\\input.txt";
        String outputPath = "E:\\output.txt";
        BufferedReader input = new BufferedReader(new FileReader(inputPath));
        BufferedWriter output = new BufferedWriter(new FileWriter(outputPath));

        String line;
        line = input.readLine();
        int T = Integer.parseInt(line);
        for (int i = 1; i <= T; ++i) {
            line = input.readLine();
            String[] words = line.split(" ");
            int N = Integer.parseInt(words[0]);
            int S = Integer.parseInt(words[1]);
            int p = Integer.parseInt(words[2]);
            int n = 0;
            int res = 0;

            for (int j = 3; j < words.length; ++j) {
                if (p == 0) {
                    res++;
                    continue;
                }

                int t = Integer.parseInt(words[j]);
                if (p == 1) {
                    if (t > 0)
                        res++;
                    continue;
                }
                if (t >= 3 * p - 2)
                    res++;
                else if (t >= 3 * p - 4)
                    n++;
            }

            res += Math.min(n, S);
            output.write("Case #" + i + ": " + res);
            output.newLine();
        }

        input.close();
        output.close();
    }
}

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

public class dancers {
	public static int test(int[] n){
		int counter = 0;
		int counter2 = 0;
		for(int i = 3; i < n[0] + 3; i++){
			if(n[i] >= (n[2]*3 - 2)){
				counter++;
			} else if((n[i] < n[2]*3 - 2) && (n[i] >= n[2]*3 - 4)){
				if((n[2]*3-4 < 0) && n[i] == 0){
					continue;
				}
				counter2++;
			}
		}
		
		if(counter2 <= n[1]){
			counter += counter2;
		} else{
			counter += + n[1];
		}
		
		return counter;
	}
	public static void main(String[] args) throws IOException{
		Scanner reader = new Scanner(new File("dancers.in"));
		PrintWriter out = new PrintWriter(new File("dancers.out"));
		
		int n = reader.nextInt();
		int[][] set = new int[n][103];
		for(int i = 0; i < n; i++){
			set[i][0] = reader.nextInt();
			for(int j = 1; j < set[i][0] + 3; j++){
				set[i][j] = reader.nextInt();
			}
		}
		int[] res = new int[n];
		for(int i = 0; i < n; i++){
			res[i] = test(set[i]);
			out.println("Case #" + (i+1) + ": " + res[i]);
		}
		
		out.close();
		System.exit(0);
	}
}