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

import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;

public class B {

	static BufferedWriter writer;

	public static void main(String[] args) throws IOException {
		writer = new BufferedWriter(new FileWriter("output.out"));
		Scanner reader = new Scanner(new FileReader("input.in"));
		int nt = reader.nextInt();
		reader.nextLine();
		for(int tc = 1; tc <= nt; tc++) {
			writer.write("Case #" + tc + ": ");
			int n = reader.nextInt();
			int s = reader.nextInt();
			int p = reader.nextInt();
			int count = 0;
			for(int i = 0; i < n; i++) {
				int t = reader.nextInt();
				if(canDoNormally(t, p)) {
					count++;
				} else if(s > 0 && canDoNormallyWith2(t, p)) {
					count++;
					s--;
				}
			}
			writer.write(Integer.toString(count));
			writer.newLine();
		}
		writer.close();
	}
	
	static boolean canDoNormallyWith2(int t, int p) {
		for(int i = 3; i <= 4; i++) {
			if((t + i) % 3 == 0 && (t + i) / 3 >= p && (t + i) / 3 - 2 >= 0) {
				return true;
			}
		}
		return false;
	}
	
	static boolean canDoNormally(int t, int p) {
		if(t % 3 == 0 && t / 3 >= p) {
			return true;
		}
		if((t + 1) % 3 == 0 && (t + 1) / 3 >= p &&  (t + 1) / 3 - 1 >= 0) {
			return true;
		}
		if((t + 2) % 3 == 0 && (t + 2) / 3 >= p &&  (t + 2) / 3 - 1 >= 0) {
			return true;
		}
		return false;
	}
	
}
