/**
 * 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.io.File;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.Scanner;

public class dancers {
	public static void main(String[] args) {
		try {
			Scanner input = new Scanner(new File("c:\\files\\B-small-attempt0.in"));
			FileWriter fw =  new FileWriter("c:\\files\\douts.txt");
			PrintWriter output = new PrintWriter(fw);
			int n = input.nextInt();
			for(int i=0;i<n;i++)
			{
				
				int noD = input.nextInt();
				int surprise = input.nextInt();
				int points = input.nextInt();
				
				int total[] = new int[noD];
				int count = 0;
				
				for(int j=0;j<noD;j++)
					total[j]=input.nextInt();
				
				for(int j=0;j<noD-1;j++)
					for(int k=j+1;k<noD;k++)
						if(total[j]<total[k])
						{
							int temp=total[j];
							total[j]=total[k];
							total[k]=temp;
						}
				
				for(int dIndex=0;dIndex<noD;dIndex++)
				{
					if(total[dIndex]>=3*points-2)
						count++;
					else if(surprise>0 && (total[dIndex]==3*points-3 || total[dIndex]==3*points-4) && total[dIndex]>0)
					{
						surprise--;
						count++;
					}
					else
						break;
				}
				output.println("Case #"+(i+1)+": "+count);
			}
			output.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}
