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

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