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

}

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-small-attempt5.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);
			
		}
		
	}

}
