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

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class DancingWithGooglers {
	public static void main (String [] args) throws FileNotFoundException
	{
		Scanner in = new Scanner (new File ("input.txt"));
		int numLines = Integer.parseInt(in.nextLine());
		int caseNum = 1;
		for (int j = 0; j < numLines; j++)
		{	
			System.out.print("Case #" + caseNum + ": ");
			int n = in.nextInt();
			int s = in.nextInt();
			int p = in.nextInt();
			int noSup = 0;
			int sup = 0;
			for (int i = 0; i < n; i++)
			{
				int total = in.nextInt();
				int maxNoSup = maxNoSup(total);
				int maxSup = maxSup(total);
//				System.out.println(total + " " + maxNoSup + " " + maxSup);
				if (maxNoSup >= p)
					noSup++;
				else if (maxSup >= p)
					sup++;
			}
			int temp = s - sup;
			if (temp <= 0)
				System.out.println((noSup + s));
			else
				System.out.println((noSup + (sup)));
			caseNum++;
		}
	}
	private static int maxNoSup(int totalScore)
	{
		int i = totalScore % 3;
		switch (i)
		{
		case 0: return totalScore/3;
		case 1: return totalScore/3 + 1;
		default: return totalScore/3 + 1;
		}
	}
	private static int maxSup(int totalScore)
	{
		if (totalScore == 0)
			return 0;
		int i = totalScore % 3;
		switch (i)
		{
		case 0: return totalScore/3 + 1;
		case 1: return totalScore/3 + 1;
		default: return totalScore/3 + 2;
		}
	}
}
