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.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;

public class B {
	Map<String, String> mapLenguaje;

	public static void main(String arg[]) {
		try {
			StringBuffer line;
			
			File file = new File("C:/Documents and Settings/jjmamby/Mis documentos/Descargas/B-large.in");
			int T = 0, N = 0, S = 0, maxP, t, bestResult, p;
			StringBuilder output = new StringBuilder();
			if (file.exists()) {
				BufferedReader input = new BufferedReader(new FileReader(file));
				
				T = Integer.valueOf((input.readLine()));
				for (int i = 0; i < T; i++) {
					line = new StringBuffer(input.readLine());
					StringTokenizer st = new StringTokenizer(line.toString(), " ");
					N = Integer.valueOf(st.nextToken());
					S = Integer.valueOf(st.nextToken());
					maxP = Integer.valueOf(st.nextToken());
					p = 0;
					for(int j = 0; j < N; j++){
						t = Integer.valueOf(st.nextToken());
						int aux1 = t / 3 ;
						bestResult = aux1;
						int aux2 = (t - aux1) / 2 ;
						
						if(aux2>bestResult){
							bestResult = aux2;
						}
						int aux3 = (t - aux1 - aux2) ;
						if(aux3>bestResult){
							bestResult = aux3;
						}
												
						if(maxP<=aux3){
							p++;
						}else if (t > 2 && t < 28){
							aux2--;
							aux3++;
							if(maxP<=aux3&& S>0 ){
								S--;
								p++;
							}
						}
					}
					output.append("Case #");
			    	output.append((i+1));
			    	output.append(": ");
			    	output.append(p);
			    	output.append("\n");
				}
				System.out.println(output.toString());
			}else{
				output.append("No hay Archivo");
			}
				
		} catch (Exception e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
}
