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 wwu.quals2012;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Set;

import lib.tuple.Pair;
import lib.tuple.Tuple;
import lib.util.StringUtil;

public class Bdancing {

	static final String fileIn = "/home/wwu/Desktop/B-small-attempt0.in";
//	static final String fileIn = "data/A-large-practice.in";
	static final String fileOut = "/home/wwu/Desktop/out.txt";
	
	public static Map<String, String> charMap;

	public static void main(String[] args) throws Exception {
		BufferedReader r = new BufferedReader(new FileReader(fileIn));
		BufferedWriter w = new BufferedWriter(new FileWriter(fileOut));
		String line = r.readLine();
		int T = Integer.parseInt(line);
		for (int caseNum = 0; caseNum < T; caseNum++) {
			int[] testCase = StringUtil.getIntArray(r.readLine());
			int nGooglers = testCase[0];
			int surprises = testCase[1];
			int pBestResultScore = testCase[2];
			List<Integer> totalScores = new ArrayList<Integer>();
			for (int i=0; i<nGooglers; i++) {
				totalScores.add(testCase[i+3]);
			}
			String str = "Case #" + (caseNum + 1) + ": " + solve(nGooglers, surprises, pBestResultScore, totalScores);
			w.write(str + "\n");
			System.out.println(str);
		}
		r.close();
		w.close();
	}

	private static String solve(int nGooglers, int surprises,
			int pBestResultScore, List<Integer> totalScores) {
		int maxPossibleGooglers = 0;
		Collections.sort(totalScores);
		Collections.reverse(totalScores);
		//int highestNoSurprise = Math.min(3*pBestResultScore+2, 30);
		//int highestWithSurprise = Math.min(3*pBestResultScore+4, 30);
		int lowestNoSurprise = Math.max(3*pBestResultScore-2, pBestResultScore);
		int lowestWithSurprise = Math.max(3*pBestResultScore-4, pBestResultScore);
		for (Integer score : totalScores) {
			if (score >= lowestNoSurprise /*&& score <= highestNoSurprise*/) {
				maxPossibleGooglers++;
			} else if (score >= lowestWithSurprise /*&& score <= highestWithSurprise*/ && surprises > 0) {
				maxPossibleGooglers++;
				surprises--;
			}
		}
		return String.valueOf(maxPossibleGooglers);
	}

}
