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.io.FileNotFoundException;
import java.util.Scanner;

import javax.swing.text.html.MinimalHTMLWriter;


public class B {

	
	public static void main(String[] args) throws FileNotFoundException {
		
		//File fich = new File("C:\\b-teste.in");
		File fich = new File("C:\\B-large.in");
		Scanner input = new Scanner(fich);

		int num_googlers, num_surp, score_min;
		
		int num_casos, resultado, tmp, resto;

		num_casos = input.nextInt();
		
		for(int i = 0; i < num_casos; i++){
			resultado = 0;
			
			num_googlers = input.nextInt(); 
			num_surp = input.nextInt();
			score_min  = input.nextInt();

			int googlers[] = new int[num_googlers];
			
			for(int j = 0; j < num_googlers; j++){
				googlers[j] = input.nextInt();
			
				if (score_min == 0){
					resultado++;
					continue;
				}
				
				if (googlers[j] == 0) 
					continue;
				
				
				tmp = googlers[j] / 3;
				resto = googlers[j] % 3;
		
				if (resto == 0){
				
					if (tmp >= score_min)
						resultado++;
					else if (num_surp > 0 && tmp + 1 >= score_min){
						resultado++;
						num_surp--;
					}
				}else if (resto == 1 ){
					
					if (tmp + 1 >= score_min)
						resultado++;
					else if (num_surp > 0 && tmp + 1 >= score_min){
						resultado++;
						num_surp--;
					}	
					
				}else if (resto == 2){
					
					if (tmp + 1 >= score_min)
						resultado++;
					else if (num_surp > 0 && tmp + 2 >= score_min){
						resultado++;
						num_surp--;
					}
					
				}
	
			}
			
			System.out.println("Case #" + (i+1) + ": " + resultado);
			
		}
		
	}

}
