/**
 * 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();
    }
}

package Googlers;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.LinkedList;
import java.util.Scanner;

import exoD.Ray;

public class googlers {

    static void print(int nbCases, int N, int S, int P, int[] T) {
	System.out.print(N + " ");
	System.out.print(S + " ");
	System.out.print(P);
	for (int j = 0; j < N; j++)
	{
	    System.out.print(" " + T[j]);
	}
	System.out.println();
    }

    static int maxWinners(int N, int S, int P, int[] T) {
	int res = 0;
	int used = 0;
	if (P == 0)
	{
	    return N;
	}
	else
	{
	    for (int i = 0; i < N; i++)
	    {
		if (T[i] >= 3 * P - 2)
		{
		    res += 1;
		}
		else if (T[i] >= 3 * P - 4 && used < S && P >= 2)
		{
		    used += 1;
		    res += 1;
		}
	    }
	}
	return res;
    }
    static void run(int N, int S, int P, int[] T, int turn) {
	System.out.println("Case #" + turn + ": " + maxWinners(N, S, P, T));
    }

    /**
     * @param args
     * @throws FileNotFoundException
     */
    public static void main(String[] args) throws FileNotFoundException {
	Scanner f = new Scanner(
	        new File(
	                "C:\\Users\\Jean-Baptiste\\Desktop\\Info2A\\GoogleJam\\src\\Googlers.in"));
	int nbCases = f.nextInt();
	int[] T = { 0 };
	int N = 1;
	int S = 1;
	int P = 1;

	for (int i = 0; i < nbCases; i++)
	{
	    N = f.nextInt();
	    S = f.nextInt();
	    P = f.nextInt();
	    T = new int[N];
	    for (int j = 0; j < N; j++)
	    {
		T[j] = f.nextInt();
	    }
	    run(N, S, P, T, i + 1);
	}

	f.close();
    }

}
