/**
 * 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 codejam02;
import java.io.*;
import java.util.logging.Level;
import java.util.logging.Logger;
import java.util.StringTokenizer;
public class CodeJam02
{
    public static void main(String[] args)
    {
        try
        {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int T,N,S,p,score;
            String input,output;
            int maxGooglers,temp ;
            T = Integer.parseInt(br.readLine());
            for (int i=0;i<T;i++)
            {
                maxGooglers = 0;
                temp = 0;
                input = br.readLine();
                StringTokenizer st = new StringTokenizer(input);
                N = Integer.parseInt(st.nextToken());
                S = Integer.parseInt(st.nextToken());
                p = Integer.parseInt(st.nextToken());
                for (int j=0; j<N; j++)
                {
                    score = Integer.parseInt(st.nextToken());
                    if(p<2)
                    {
                        if(score >= p) maxGooglers++;
                    }
                    else
                    {
                        if(score==(3*p-4)||score==(3*p-3))
                        {
                            temp++;
                        }
                        else if(score>(3*p-3))
                        {
                            maxGooglers++;
                        }
                    } 
                }
                if(temp<S) maxGooglers+=temp;
                else maxGooglers+=S;
                System.out.println("Case #" +(i+1) + ": " + maxGooglers);
            }
        }
        catch (IOException ex)
        {
            Logger.getLogger(CodeJam02.class.getName()).log(Level.SEVERE, null, ex);
        }
    }
}
