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.util.Scanner;


public class DancingWithTheGooglers {
	
	public static void main(String[] args)  {
		
		Scanner scanner = new Scanner(System.in);
		String line = scanner.nextLine().trim();
		int totalCase = Integer.parseInt(line);
		
		for (int i = 1; i <= totalCase; i++)  {
			line = scanner.nextLine().trim();
			String parts[] = line.split(" +");
			
			int numOfGooglers = Integer.parseInt(parts[0]);
			int numOfSuprises = Integer.parseInt(parts[1]);
			int bestResult = Integer.parseInt(parts[2]);

			String output = "Case #" + i + ": ";
			int possible = 0;
			int impoosible = 0;
			for (int count = 0; count < numOfGooglers; count++)  {
				int index = 3+count;
				int totalPoints = Integer.parseInt(parts[index]);
				if (totalPoints < bestResult)  {
					impoosible++;
					continue;
				}
				
				int sumOfTwo = totalPoints - bestResult;
				float avgOfTwo = sumOfTwo / 2.0f;
				
				int num2 = (int)Math.floor(avgOfTwo);
				int num3 = (int)Math.ceil(avgOfTwo);
				
				int diff1 = bestResult - num2;
				int diff2 = bestResult - num3;
				
				if (diff1 <= 1 && diff2 <= 1)  {
					possible++;
				}  else if (diff1 >= 3 || diff2 >= 3)  {
					impoosible++;
				}
			}
			
			int googlersLeft = numOfGooglers - possible;
			int possibleGooglers = (googlersLeft - impoosible > numOfSuprises ? numOfSuprises : googlersLeft - impoosible);
			
			int p = possible + possibleGooglers;

			output += p;
			System.out.println(output);
		}
		
		System.exit(0);
	}
	
}
