/**
 * 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.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;

public class MaxDancers {

	public static void main(String[] args)throws IOException {

		String fichierentree= "/home/marwen/TÃ©lÃ©chargements/B-small-attempt0.in";
		String fichiersortie= "/home/marwen/Bureau/output.in";

		BufferedWriter	 wr= new BufferedWriter(new FileWriter(fichiersortie));
		DataInputStream	 rd= new DataInputStream(new FileInputStream(fichierentree));		
		
		//Reading number of cases
		String ligne = rd.readLine();
		int cases = Integer.valueOf(ligne);
		
		int k;
		for (k=1;k<=cases;k++) 
		{
			//Reading ligne by ligne
			ligne = rd.readLine();
			ligne=ligne+" ";
			
			// Reading length of the table and filling in it with numbers
			
			int taille = Integer.valueOf(ligne.substring(0, ligne.indexOf(" ")));
			int [] T1= new int [3+taille];
			T1[0]=taille;
			int i,val;
			for (i=1;i<3+taille;i++)
			{
				 ligne=ligne+" ";
				 ligne = ligne.substring(ligne.indexOf(" ") + 1);
				 val = Integer.valueOf(ligne.substring(0, ligne.indexOf(" ")));
				 T1[i]=val;
			}
			
			// End of Reading table from ligne
			
			//Solving the problem for each Line
			
			int s,p,nb,l;
			s=T1[1];
			p=T1[2];
			nb=0;
			l=T1.length;
			for(i=3;i<l;i++)
			{
				if (T1[i]>=p)
				{
				if (T1[i]>=3*p-2) {nb++;}
				else {if ((T1[i]>=3*p-3)||(T1[i]>=3*p-4)){if (s>0){nb++;s--;}}}
				}
			}
			
			//Writing into the output file before moving to the next Line
			wr.write("Case #"+k+": "+nb);
			wr.newLine();
		}	
		
	wr.close();
	rd.close();
	}
}
