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 com.google.codejam;

import java.io.File;
import java.io.IOException;
import java.util.List;

import com.google.common.base.CharMatcher;
import com.google.common.base.Function;
import com.google.common.base.Splitter;
import com.google.common.collect.Iterables;
import com.google.common.collect.Lists;
import com.google.common.io.Files;
import com.google.gdata.util.common.base.Charsets;

public class ProblemB {
	
	public static void main (String [] args) throws IOException {
		if (args.length != 1) {
			System.err.println("Usage: ProblemB inputfile");
			return;
		}
		String filename = args[0];
		List<String> inputLines = Files.readLines(new File(filename), Charsets.US_ASCII);
		int T = Integer.parseInt(inputLines.get(0));
		List<String> testCases = inputLines.subList(1, inputLines.size());
		assert(T == testCases.size());
		for (int i = 0; i < testCases.size(); i++) {
			processLine(testCases, i);
		}
	}

	private static void processLine(List<String> testCases, int i) {
		String line = testCases.get(i);
		List<Integer> lineContents = Lists.newArrayList(Iterables.transform(Splitter.on(CharMatcher.WHITESPACE).split(line), new Function<String, Integer>() {
			@Override
			public Integer apply(String input) {
				return Integer.parseInt(input);
			}
		}));
		
		int numGooglers = lineContents.get(0);
		int numSurprising = lineContents.get(1);
		int targetBestResult = lineContents.get(2);
		List<Integer> scores = lineContents.subList(3, lineContents.size());
		assert(numGooglers == scores.size());
		int maxNumGooglers = 0;
		int numGooglersWithSurprise = 0;
		for (int score : scores) {
			if (((score + 2) / 3) >= targetBestResult) {  // This is equivalent to ciel(score/3) >= targetBestResult
				maxNumGooglers++;
			} else if ((score + 4) / 3 >= targetBestResult && score > 0) {
				numGooglersWithSurprise++;
			}
		}
		
		maxNumGooglers += Math.min(numGooglersWithSurprise, numSurprising);
		System.out.println("Case #" + (i+1) + ": " + maxNumGooglers);
	}

}
