import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

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