/**
 * 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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;


public class DancingWiththeGooglers 
{
public static void main(String[] args) throws IOException {
	FileWriter wr=new FileWriter("Output.txt");
	BufferedWriter buff=new BufferedWriter(wr);
	
	FileReader read=new FileReader("B-small-attempt2.in");
	BufferedReader buffr=new BufferedReader(read);
	
	String str;
	str=buffr.readLine();
	int n=Integer.parseInt(str);
	int j=1;
	Scanner sc;
	int googleres,s,p;
int list[];
	int i;
	int num;
	int total=0;
	while(j<=n)
	{
		int non[]={0,1,1,1,2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,8,8,8,9,9,9,10,10,10};
		
		int sup[]={-1,-1,-1,2,3,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,8,8,8,9,9,10,10,10,-1,-1,-1};
		
		total=0;
	str=buffr.readLine();
	sc=new Scanner(str);
	sc.useDelimiter(" ");
	googleres=sc.nextInt();
	s=sc.nextInt();
	p=sc.nextInt();
	i=1;
	list=new int[googleres];
	while(i<=googleres)
	{
	list[i-1]=sc.nextInt();
	i++;
	}
	
	if(s==0)
	{
		for(int k=1;k<=googleres;k++)
		{
			num=list[k-1];
			if(non[num]>=p)
				++total;
		}
		
	}
	else
	{
		
		for(int k=1;k<=googleres;k++)
		{
			if(s!=0)
			{
			num=list[k-1];
			if(non[num]>=p)
				++total;
			else
			{
				if(sup[num]>=p)
				{
					--s;
					++total;
				}
			}
		}
			else
			{
				num=list[k-1];
				if(non[num]>=p)
					++total;
			}
			
		}	
		
	}
		
	StringBuffer temp = new StringBuffer("Case #"+j+": ");
	temp=temp.append(Integer.toString(total));
	buff.write(temp.toString());
	buff.newLine();
	j++;
	}
buff.close();
}
}
