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);
		
		
		
	}
}

package gcj2012.qr;

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

/**
 *
 * @author Scott DellaTorre
 */
public class B {

    public static void main(String[] args) throws IOException {

        BufferedReader in = new BufferedReader(new FileReader("src/gcj2012/qr/in"));
        PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("src/gcj2012/qr/B.out")));

        int T = Integer.parseInt(in.readLine());
        for (int i = 0; i < T; i++) {
            StringTokenizer st = new StringTokenizer(in.readLine());
            int N = Integer.parseInt(st.nextToken()); // Number of Googlers
            int S = Integer.parseInt(st.nextToken()); // Number of suprising cases
            int p = Integer.parseInt(st.nextToken());
            int[] t = new int[N]; // Total points of the Googlers
            for (int j = 0; j < N; j++) {
                t[j] = Integer.parseInt(st.nextToken());
            }

            // What is the maximum number of Googlers that could have had a best
            // result of at least p?

            int lowSurprising = p < 2 ? p : p * 3 - 4;
            int lowNormal = p < 1 ? p : p * 3 - 2;

            int count = 0;
            for (int j = 0; j < N; j++) {
                if (t[j] >= lowNormal) {
                    count++;
                } else if (S > 0 && t[j] >= lowSurprising) {
                    S--;
                    count++;
                }
            }

            out.println("Case #" + (i + 1) + ": " + count);
        }

        out.close();
    }
}
