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

import java.io.*;
import java.lang.Math.*;
import java.util.HashMap;

public class B {

	public static void main(String[] args) {

		try {
			BufferedReader input = new BufferedReader(new FileReader("C:/CodeJam/B-small-attempt2.in"));
			BufferedWriter output = new BufferedWriter(new FileWriter("C:/CodeJam/B-small-attempt2.out"));
			try {
				int T = Integer.parseInt(input.readLine());

				//Process each case
				for (int i = 0; i < T; i++) {
					String line = input.readLine();

					String[] data = line.split(" ");
					int N = Integer.parseInt(data[0]);
					int S = Integer.parseInt(data[1]);
					int p = Integer.parseInt(data[2]);

					//Count the possible surprising/unsurprising scores
					int countU = 0;
					int countS = 0;
					for (int j = 0; j < N; j++) {
						int score = Integer.parseInt(data[j + 3]);

						//Minimum score to be surprising/unsurprising
						int minScoreS = 2 * (p - 2) + p;
						int minScoreU = 2 * (p - 1) + p;
						if (p == 0) {
							countU++;
						} else if (p == 1 && score > 0) {
							countU++;
						} else if (minScoreU >= 0 && score >= minScoreU) {
							countU++;
						} else if (minScoreS >= 0 && score >= minScoreS) {
							countS++;
						}
					}
					output.write("Case #" + (i + 1) + ": " + (countU + Math.min(S, countS)) + "\n");
				}
			} finally {
				input.close();
				output.close();
			}
		} catch (IOException ex) {
			ex.printStackTrace();
		}
	}
}
