import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

package dancingWithTheGooglers;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.StringReader;
import java.io.Writer;
import java.util.Arrays;
import java.util.Scanner;

public class DancingWithTheGooglers {

	public static String processaCaso(String linha, int i) {
		Scanner scan = new Scanner(new StringReader(linha));
		int numGooglers = scan.nextInt();
		int numSurprising = scan.nextInt();
		int p = scan.nextInt();
		int [] scores = new int[numGooglers];
		for (numGooglers--; numGooglers >= 0; numGooglers--) {
			scores[numGooglers] = scan.nextInt();
		}
		Arrays.sort(scores);
		int maxBestResult = 0;
		int idxMaiorQP = scores.length -1;
		for (; idxMaiorQP >= 0; idxMaiorQP--) {
			int resto = scores[idxMaiorQP]%3;
			int bestResult = scores[idxMaiorQP]/3;
			if (resto > 0) bestResult += 1;
			if (bestResult < p) break;
			maxBestResult++;
		}
		while (numSurprising > 0 && idxMaiorQP >= 0) {
			int resto = scores[idxMaiorQP]%3;
			int bestResult = scores[idxMaiorQP]/3;
			if (bestResult > 0 && resto == 0) bestResult += 1;
			else bestResult += resto;
			if (bestResult < p) break;
			maxBestResult++;
			numSurprising--;
			idxMaiorQP--;
		}
		return String.format("Case #%d: %d", i, maxBestResult);
	}
	
	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
        Scanner scan = new Scanner(new File(args[0]));
        int numTestCases = scan.nextInt();
        scan.nextLine();
        Writer saida = new FileWriter(args[0]+".out");
		for (int i = 1 ; i <= numTestCases; i++) {
			saida.write(processaCaso(scan.nextLine(),i)+"\n");
		}
		saida.close();
	}

}
