/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}

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);
        }
    }
}
