package code12.qualification;

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

public class B {
	public static String solve(int N, int S, int p, int[] t) {
		
		// 3a 		-> (a, a, a), *(a - 1, a, a + 1)
		// 3a + 1	-> (a, a, a + 1), *(a - 1, a + 1, a + 1)
		// 3a + 2	-> (a, a + 1, a + 1), *(a, a, a + 2)
		
		int numPNoS = 0;
		int numPWithS = 0;
		
		for (int i = 0; i < N; i++) {
			int a = (int)Math.floor(t[i] / 3);
			int r = t[i] % 3;
			
			switch (r) {
			case 0:
				if (a >= p) {
					numPNoS++;
				} else if (a + 1 >= p && a - 1 >= 0) {
					numPWithS++;
				}
				break;
			case 1:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				}
				break;
			case 2:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				} else if (a + 2 >= p) {
					numPWithS++;
				}
				break;
			}
		}
		
		return "" + (numPNoS + Math.min(S, numPWithS));
	}

	public static void main(String[] args) throws Exception {
		// file name
		//String fileName = "Sample";
		//String fileName = "B-small";
		String fileName = "B-large";
		
		// file variable
		File inputFile = new File(fileName + ".in");
		File outputFile = new File(fileName + ".out");
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);

		// problem variable
		int totalCase;
		int N, S, p;
		int[] t;

		// get total case
		totalCase = scanner.nextInt();

		for (int caseIndex = 1; caseIndex <= totalCase; caseIndex++) {
			// get input
			N = scanner.nextInt();
			S = scanner.nextInt();
			p = scanner.nextInt();
			t = new int[N];
			
			for (int i = 0; i < N; i++) {
				t[i] = scanner.nextInt();
			}
			
			String output = "Case #" + caseIndex + ": " + solve(N, S, p, t);
			System.out.println(output);
			writer.write(output + "\n");
		}
		scanner.close();
		writer.close();
	}
}

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


public class DancingGooglers {

	public static void calculate(File file){
		
		String output="";
		int cases = 0;
		String singleLine = "";
		try{
			Scanner scanner = new Scanner(file);
			cases = Integer.parseInt(scanner.nextLine());
			int []result = new int[cases];	
			int counter=0;
			for(int i=0; i<cases;i++){
				singleLine=scanner.nextLine();
				String [] words = singleLine.split(" ");
				int [] numbers = new int [words.length];
				int player=0;
				int surprise=0;
				int best=0;
				for(int j=0;j<words.length;j++){
					numbers[j]=Integer.parseInt(words[j]);
				}
				player=numbers[0];
				surprise=numbers[1];
				best=numbers[2];
				int[]scores= new int[player];
				for(int k=0;k<player;k++){
					scores[k]=numbers[k+3];
				}
				for(int l=0;l<scores.length;l++){
					if(scores[l]>=3*best-2){
						counter++;
					}
					if((3*best-4>=0)&&(surprise!=0)&&(scores[l]>=3*best-4)&&(scores[l]<3*best-2)){
						counter++;
						surprise--;
					}
					
				}
				result[i]=counter;
				
				output+="Case #"+(i+1)+": ";
				output+=result[i]+" ";
				output+="\n";
				counter=0;
			}
		}catch(Exception e){
			System.out.println("Please debug this program to find the exception.");
		}
		
		System.out.println(output);	
	}
	public static void main(String[] args) {
		File file = new File("./src/B-large.in");
		calculate(file);
	}

}
