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

public class CodeJam2 {

	
	public static void main(String[] args) 
	{
	Scanner input=new Scanner(System.in);
	int types=input.nextInt();
	for(int i=0;i<types;i++)
	{
	int count1=0,count2=0;
	int n=input.nextInt();
	int array2[]=new int[n];
	int surprise=input.nextInt();
	int p=input.nextInt();
	for(int j=0;j<n;j++)
	{
	array2[j]=input.nextInt();
	}		
	int array1[][]=new int[n][3];
	for(int j=0;j<n;j++)
	{
	array1[j][0]=array2[j]/3;
	int t=array2[j]-array1[j][0];
	int c1=t/2;
	int c2=t-c1;
	if(array2[j]!=0)
	{
	if(c1-c2==0)
	{
	if(p-c1==1)
	{
	if(count1<surprise)
	{
	count1++;
	count2++;
	array1[j][1]=c1--;
	array1[j][2]=c2++;
	}
	else
	{
	array1[j][1]=c1;
	array1[j][2]=c2;
	}
	}
	else if (p-c1==0)
	{
	array1[j][2]=c2;
	++count2;
	array1[j][1]=c1;
	}
	else if(p-c1>1)
	{
	array1[j][1]=c1;
	array1[j][2]=c2;
	}
	else if(p-c1<0)
	{
	array1[j][2]=c2;
	++count2;
	array1[j][1]=c1;
	}
	}
				
	else if((c2-c1)==1)
	{
	if(p<=c2)
	{
	array1[j][2]=c2;
	++count2;
	array1[j][1]=c1;
	}
	else 
	{
	array1[j][2]=c2;
	array1[j][1]=c1;
	}
	}
	}
	else{
	if(p==0)
	{
	++count2;
	}
	}
	}
	System.out.println("Case #"+(i+1)+": " +count2);
	}

	}

}
