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 the2012;

import java.io.*;
import java.util.Scanner;

public class DancingWithTheGooglers {


    public static void main(String[] args) throws Exception {
        Scanner scanner = new Scanner(new BufferedInputStream(new FileInputStream("/Users/taobo2/Downloads/B-small-attempt0.in.txt")));
        Writer output = new BufferedWriter(new FileWriter("B-small-attempt0.output-b.txt"));

        int T = scanner.nextInt();
        for (int i = 1; i <= T; ++i) {
            int N = scanner.nextInt();
            int[] total = new int[N];
            int s = scanner.nextInt();
            int p = scanner.nextInt();
            for (int j = 0; j < N; ++j) {
                total[j] = scanner.nextInt();
            }
            output.write("Case #" + i + ": " + sovle(total, p, s));
            output.write(System.getProperty("line.separator"));
        }
        output.close();
        scanner.close();
    }


    public static int sovle(int[] total, int p, int s) {
        int ret = 0;
        for (int t : total) {
            int mod = t % 3;
            switch (mod) {
                case 0:
                    if (t / 3 >= p) ret++;
                    else if (s > 0) {
                        int smallest = (t - 3) / 3;
                        if (smallest < 0) {
                            break;
                        }
                        if (smallest + 2 >= p) {
                            s--;
                            ret++;
                        }
                    }
                    break;

                case 1:
                    if ((t - 1) / 3 + 1 >= p) ret++;
                    else if (s > 0) {
                        int smallest = (t - 4) / 3;
                        if (smallest < 0) {
                            break;
                        }
                        if (smallest + 2 >= p) {
                            ret++;
                            s--;
                        }
                    }
                    break;

                case 2:
                    if ((t - 2) / 3 + 1 >= p) ret++;
                    else if (s > 0) {
                        int smallest = (t - 2) / 3;
                        if (smallest < 0) {
                            break;
                        }

                        if (smallest + 2 >= p) {
                            ret++;
                            s--;
                        }
                    }
                    break;
            }
        }
        return ret;
    }
}
