import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}



import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;

public class ProbB {

    public static void main(String[] args) throws Exception {
        FileReader fr = new FileReader("B-small-attempt0.in");
        BufferedReader br = new BufferedReader(fr);

        FileWriter fw = new FileWriter("outB.txt");
        BufferedWriter bw = new BufferedWriter(fw);

        String a = br.readLine();
        int cases = Integer.parseInt(a);
        
        int n=0, s=0, p=0, num=0;
        
        for (int i = 1; i < cases+1; i++) {
            String testCase = br.readLine();
            String tokens[] = testCase.split(" ");
            n= Integer.parseInt(tokens[0]);
            s = Integer.parseInt(tokens[1]);
            p = Integer.parseInt(tokens[2]);
            
            int count = 0;
            for (int j = 3; j < n + 3; j++) {
                num = Integer.parseInt(tokens[j]);
                if ((num - p) >= 2 * (p - 1) && (num - p) >= 0) {
                    count++;
                } else if ((num - p) < 2 * (p - 1) && (num - p) >= 0) {
                    if (s != 0 && (num - p) >= 2 * (p - 2)) {
                        count++;
                        s--;
                    }
                }
            }
            String result = "Case #" + (i) + ": " + count;
            bw.write(result);
            bw.newLine();

        }

        bw.close();
        fw.close();

        br.close();
        fr.close();
    }
}
