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 codejam.surprisingGooglers;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;

public class Solver {

	public int getMaximumNumberOfPHavers(int numberOfSurprises, int bestResult, Integer... totals){
		List<PossibleSurpriseCase> allCases = buildCases(numberOfSurprises, Arrays.asList(totals));
		int maxPHavers = 0;
		for (PossibleSurpriseCase surpriseCase : allCases) {
			maxPHavers = Math.max(surpriseCase.getMaximumPHavers(bestResult), maxPHavers);
		}
		return maxPHavers;
	}

	private List<PossibleSurpriseCase> buildCases(int numberOfSurprises, List<Integer> totals) {
		if (totals.isEmpty()) return Collections.singletonList(PossibleSurpriseCase.trivial());
		List<PossibleSurpriseCase> surprise = combine(true, totals.get(0), buildCases(numberOfSurprises-1, totals.subList(1, totals.size())));
		if (numberOfSurprises == totals.size()) return surprise;
		List<PossibleSurpriseCase> noSurprise = combine(false, totals.get(0), buildCases(numberOfSurprises, totals.subList(1, totals.size())));
		if (numberOfSurprises <= 0) return noSurprise;
		return append(surprise,	noSurprise);
	}
	
	private List<PossibleSurpriseCase> append(
			List<PossibleSurpriseCase> one,
			List<PossibleSurpriseCase> two) {
		List<PossibleSurpriseCase> r = new ArrayList<PossibleSurpriseCase>(one.size() + two.size());
		r.addAll(one);
		r.addAll(two);
		return r;
	}

	public static List<PossibleSurpriseCase> combine(boolean isSurprise, int score, List<PossibleSurpriseCase> cases) {
		List<PossibleSurpriseCase> r = new ArrayList<PossibleSurpriseCase>(cases.size());
		for (PossibleSurpriseCase surpriseCase : cases) {
			r.add(PossibleSurpriseCase.combine(isSurprise, score, surpriseCase));
		}
		return r;
	}

	
}
