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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;

public class DancingWithTheGooglers {
	public static void main(String[] args) {
		try {
			BufferedReader in = new BufferedReader(new FileReader("file.in"));
			BufferedWriter out = new BufferedWriter(new FileWriter("file.out"));
			int n = Integer.parseInt(in.readLine());
			for (int i = 1; i <= n; ++i) {
				String[] ints = in.readLine().split(" ");
				int N = Integer.parseInt(ints[0]);
				int S = Integer.parseInt(ints[1]);
				int p = Integer.parseInt(ints[2]);
				int[] ts = new int[N];
				for (int j = 0; j < N; ++j)
					ts[j] = Integer.parseInt(ints[3 + j]);
				int m = 0;
				try {
					m = max(N, S, p, ts);
				}
				catch (Exception e) {
					System.err.println("Unexpected exception, I made a mistake...");
					e.printStackTrace();
					System.exit(1);
				}
				out.write("Case #" + i + ": " + m);
				if (i != n)
					out.newLine();
			}
			out.close();
		}
		catch (Exception e) {
			System.err.println("Unexpected error occured while reading input!");
			e.printStackTrace();
			System.exit(1);
		}
	}
	
	private static int max(int N, int S, int p, int[] ts) {
		if (N > 0) {
			int t = ts[--N];
			int k = t / 3;
			int a, b;
			switch (t % 3) {
				case 0:
					// k k k
					a = (k >= p ? 1 : 0) + max(N, S, p, ts);
					// k-1 k k+1 (*)
					b = (k - 1 >= 0 && k + 1 >= p ? 1 : 0) + max(N, S - 1, p, ts);
					break;
				case 1:
					// k k k+1
					a = (k + 1 >= p ? 1 : 0) + max(N, S, p, ts);
					// k-1 k+1 k+1 (*)
					b = (k - 1 >= 0 && k + 1 >= p ? 1 : 0) + max(N, S - 1, p, ts);
					break;
				case 2:
					// k k+1 k+1
					a = (k + 1 >= p ? 1 : 0) + max(N, S, p, ts);
					// k k k+2 (*)
					b = (k + 2 >= p ? 1 : 0) + max(N, S - 1, p, ts);
					break;
				default:
					return Integer.MIN_VALUE; // never happens.
			}
			return Math.max(a, b);
		}
		return S == 0 ? 0 : Integer.MIN_VALUE;
	}
}
