import java.util.List;


public class Case implements Runnable {

	private int id;
	private String output;

	private int n;
	private int s;
	private int p;
	private List<Integer> g;

	public Case(int id) {
		this.id = id;
	}

	public Case(int id, int n, int s, int p, List<Integer> g) {
		super();
		this.id = id;
		this.n = n;
		this.s = s;
		this.p = p;
		this.g = g;
	}

	public String solve() {
		int res = 0;
		for (int googler : g) {
			int b = googler / 3;
			boolean div = googler % 3 == 0;
			if (b >= p) {
				res++;
				continue;
			}
			if (p == b+1) {
				if (div && s > 0 && b > 0) {
					res++;
					s--;
					continue;
				}
				if (!div) {
					res++;
					continue;
				}
			}
			if (p == b+2) {
				if (3*b+2 == googler && s > 0) {
					res++;
					s--;
				}
			}
		}
		return String.valueOf(res);
	}

	@Override
	public void run() {
		output = solve();
	}

	@Override
	public String toString() {
		return "Case #" + id + ": " + output;
	}

}
package codejam.qualification;

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

public class Dancing {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException {
		String file = "input2small";
		Scanner in = new Scanner(new File(file));
		int tot = Integer.parseInt(in.nextLine());
//		System.out.println(tot);
		for(int i=0;i<tot;i++) {
			String line = in.nextLine();
			String[] data = line.split(" ");
			int N = Integer.parseInt(data[0]);
			int S = Integer.parseInt(data[1]);
			int p = Integer.parseInt(data[2]);
			
			int output = 0;
			switch(p) {
			case 0:
				output = N;
				break;
			case 1:
				for(int j=0; j<N; j++) {
					int t = Integer.parseInt(data[3+j]);
					if(t > 0) output++;
				}
				break;
			default:
				int temp = 0;
				for(int j=0; j<N; j++) {
					int t = Integer.parseInt(data[3+j]);
					if(t >= 3*p-2)
						output++;
					else
						if(t >= 3*p-4)
							temp++;
				}
				if(temp <= S)
					output += temp;
				else
					output += S;
			}
			
			System.out.println("Case #"+(i+1)+": "+output);
		}
		
	}

}
