/**
 * 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();
    }
}

package trupti;
import java.io.*;
import java.util.*;
public class Main2 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
	//	char c[];
		int count=0;
		try {
			FileOutputStream out=new FileOutputStream("out7.out");
			Scanner inFIle=new Scanner(new FileReader("B-small-attempt2.in") );
			int t=inFIle.nextInt();
			
			while (t!=0) {
				count++;
				int a=0,b=0;
				int n=inFIle.nextInt();
				int s=inFIle.nextInt();
				int p=inFIle.nextInt();
				int ti[]=new int[n];
				int m[][]=new int[n][3];
				int cn=0;
				for(int i=0;i<n;i++)
				{
					ti[i]=inFIle.nextInt();
					m[i][0]=ti[i]/3;
					m[i][1]=ti[i]/3;
					m[i][2]=ti[i]/3;
					//System.out.println(m[i][0]+" "+m[i][3]+" "+m[i][2]);
					if((ti[i]%3)==2)
					{
						m[i][0]++;
						m[i][1]++;
					}
					if((ti[i]%3)==1)
						m[i][0]++;
					
					if((m[i][0]<p) &(m[i][0]>=1))
					{
						a=p-m[i][0];
						/*if(a==2 & s>0)
							if((m[i][0]==m[i][1])&(m[i][1]==m[i][2]))
						{
							m[i][0]+=2;
							m[i][1]--;
							m[i][2]--;
							s--;
						}*/
						if(a==1 & s>0)
						{
							if((m[i][0]==m[i][1])&(m[i][1]==m[i][2]))
							{
								m[i][0]+=1;
								m[i][1]--;
							//	m[i][2]--;
								s--;
							}
							else
							{
								if((m[i][0]==m[i][1])&((m[i][1]-m[i][2])==1))
								{
									m[i][0]+=1;
									m[i][1]--;
								//	m[i][2]--;
									s--;
								}
							}
						}
					}
					System.out.println(m[i][0]);
					if(m[i][0]>=p)
						cn++;
				}
				
				
					out.write(("Case #"+count+": "+cn+"\n").getBytes());
					System.out.print("case #"+count+": "+cn+"\n");
				
				//System.out.println(str);
				t--;
			}
			
		} catch (Exception e) {
			// TODO: handle exception
		}
	
	}

}
