/*
 * 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 code_jam_quali;

import java.util.Scanner;

/**
 *
 * @author sansarun
 */
public class Dancing {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int caseNum = sc.nextInt();

        for (int currentCase = 1; currentCase <= caseNum; currentCase++) {
            int googlers = sc.nextInt();
            int surprise = sc.nextInt();
            int p = sc.nextInt();

            int alreadyPass = 0;
            int canHelp = 0;

            for (int i = 0; i < googlers; i++) {
                int totalScore = sc.nextInt();
                int maxCompound = findMaxCompound(totalScore);
                int fragment = totalScore % 3;

                if (totalScore < 3) {
                    if(findMaxCompound(totalScore) >= p) {
                        alreadyPass++;
                    }
                } else {
                    switch (fragment) {
                        case 1:
                            if (maxCompound >= p) {
                                alreadyPass++;
                            }
                            break;
                        case 0:
                        case 2:
                            if (maxCompound >= p) {
                                alreadyPass++;
                            } else if (maxCompound + 1 >= p) {
                                canHelp++;
                            }
                            break;
                    }
                }
            }
            int totalPass = alreadyPass + (canHelp > surprise ? surprise : canHelp);
            System.out.println(String.format("Case #%d: %d", currentCase, totalPass));
        }
    }

    private static int findMaxCompound(int n) {
        return (int) Math.round(Math.ceil(n / 3.0));
    }
}
