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 codejam2012.qualification;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;


public class B {
	static File inFile = new File("inQBsmall.txt");
	static File outFile = new File("outQBsmall.txt");
	static BufferedReader in;
	static BufferedWriter out;
	static Scanner sc;

	static int T = 0;
	
	
	public static void solve() throws IOException{
		T = sc.nextInt();
		for (int i=0;i<T;i++) {						

			int N = sc.nextInt();
			int S = sc.nextInt();
			int p = sc.nextInt();

			int res = 0;
			
			for (int j=0;j<N;j++) {
				int g = sc.nextInt();
				if (p==0) {
					res++;					
				} else if (p==1) {
					if (g>=1) res++;
				}
				else if (g>=p+(p-1)+(p-1)) res++;				
				else if (S>0 && g>=p+(p-2)+(p-2)) {
					res++;
					S--;
				}
			}
			

			//StringBuffer res = new StringBuffer();

			//System.out.println(res.toString());
			out.write("Case #"+(i+1)+": "+String.valueOf(res)+"\n");
		}
	}
	
	public static void main(String[] args) throws IOException {
		try {
			in = new BufferedReader(new FileReader(inFile));
			out = new BufferedWriter(new FileWriter(outFile));
			sc = new Scanner(in);
			solve();
		} catch (Exception e) {
			e.printStackTrace();
		} finally {
			in.close();
			out.close();		
		}		

	}
}

