/**
 * 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.Scanner;

public class Main
{
	public static void main(String[] args)
	{
		Scanner oku = new Scanner(System.in);

		int test = oku.nextInt(), n, s, p;

		int surp_siniri;
		int enAzindan, kesin_surp, toplam;

		for (int i = 0; i < test; i++, oku.nextLine())
		{
			n = oku.nextInt();
			s = oku.nextInt();
			p = oku.nextInt();

			if (p == 0 || p == 1)
			{
				surp_siniri = s;
			}
			else
			{
				surp_siniri = 3 * p - 4;
			}

			enAzindan = 0;
			kesin_surp = 0;

			for (int j = 0; j < n; j++)
			{
				toplam = oku.nextInt();

				if (toplam >= 2)
				{
					if (toplam >= surp_siniri && toplam <= surp_siniri + 1)
					{
						kesin_surp++;
					}
					else if (toplam > surp_siniri + 1)
					{
						enAzindan++;
					}
				}
				else
				{
					if (surp_siniri == 0 && toplam >= p)
					{
						enAzindan++;
					}
				}
			}

			if (kesin_surp >= s)
			{
				System.out.println("Case #" + (i + 1) + ": " + (enAzindan + s));
			}
			else
			{
				System.out.println("Case #" + (i + 1) + ": " + (enAzindan + kesin_surp));
			}
		}
	}
}
