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

import Controller.IO;

public class GooglereseCase extends CaseSolver {

	static Character[] opa;
	static {
		opa = new Character[26];
		opa['a' - 97] = 'y';
		opa['b' - 97] = 'h';
		opa['c' - 97] = 'e';
		opa['d' - 97] = 's';
		opa['e' - 97] = 'o';
		opa['f' - 97] = 'c';
		opa['g' - 97] = 'v';
		opa['h' - 97] = 'x';
		opa['i' - 97] = 'd';
		opa['j' - 97] = 'u';
		opa['k' - 97] = 'i';
		opa['l' - 97] = 'g';
		opa['m' - 97] = 'l';
		opa['n' - 97] = 'b';
		opa['o' - 97] = 'k';
		opa['p' - 97] = 'r';
		opa['q' - 97] = 'z';
		opa['r' - 97] = 't';
		opa['s' - 97] = 'n';
		opa['t' - 97] = 'w';
		opa['u' - 97] = 'j';
		opa['v' - 97] = 'p';
		opa['w' - 97] = 'f';
		opa['x' - 97] = 'm';
		opa['y' - 97] = 'a';
		opa['z' - 97] = 'q';
	}

	StringBuilder line;

	public GooglereseCase(int order, int numberOfLines, IO io) {
		super(order, numberOfLines, io);
	}

	@Override
	public void addLine(String line) {
		this.line = new StringBuilder(line);
	}

	@Override
	public void printSolution() {
		System.err.println("Case #" + getOrder() + ": " + line);
	}

	@Override
	public CaseSolver process() {
		for (int i = 0; i < line.length(); i++) {
			char temp = line.charAt(i);
			if (temp != ' ')
				line.setCharAt(i, opa[temp - 97]);
		}
		return this;
	}

	@Override
	public void initializeVars() {
		// TODO Auto-generated method stub

	}

}
