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

import java.util.Arrays;

import template.Template;

public class DancingWithTheGooglers extends Template {
	public static void main(String[] args) throws Exception {

		init("src/dancingwiththegooglers/B-small-attempt3");
		int lines = readInt();
		for (int i = 1; i <= lines; i++) {
			int[] line = readIntArray();
			int n = line[0];
			int s = line[1];
			int p = line[2];
			int[] t = new int[n];
			int result = 0;
			for (int j = 0; j < n; j++) {
				t[j] = line[j + 3];
				int m = t[j] / 3;
				int r = t[j] % 3 > 0 ? 1 : 0;
				if (m >= p)
					result++;
				else if (m + r >= p
						&& (m - r >= 0 || m + r > 0 && t[j] % 3 == 2))
					result++;
				else if (m + r + 1 >= p && s > 0 && m - r - 1 >= 0
						&& t[j] % 3 != 1) {
					result++;
					s--;
				}

			}

			System.out.println("\n" + Arrays.toString(line));
			write("Case #" + i + ": " + result);
		}
	}
}
