import java.util.Scanner;
import java.io.*;
class dance
{
  public static void main (String[] args) throws IOException
  { 
    File    inputData = new File("B-small-attempt0.in");
	File 	outputData= new File("Boutput.txt");
    Scanner scan = new Scanner( inputData );
	PrintStream print= new PrintStream(outputData);
    
	int t;
	int n,s,p,pi;
	t= scan.nextInt();
	for(int i=1;i<=t;i++)
	{
	n=scan.nextInt();	s=scan.nextInt();	p=scan.nextInt();
	int supTrip=0, notsupTrip=0;
	
	for(int j=0;j<n;j++)
	{
		pi=scan.nextInt();
		if(pi>(3*p-3))
		notsupTrip++;
		else if((pi>=(3*p-4))&&(pi<=(3*p-3))&&(pi>p))
		supTrip++;
	}
	
	if(s<=supTrip)
	notsupTrip=notsupTrip+s;
	else if(s>supTrip)
	notsupTrip= notsupTrip+supTrip;
	print.println("Case #"+i+": "+notsupTrip);
	}
  }
}
import java.util.Scanner;

public class DanceWGoogle {

	public static int testcase(int S, int p, int[] arr) {
		int over = 0;
		int oneund = 0;
		int temp;
		for (int i = 0; i < arr.length; i++) {
			temp=0;
			if (arr[i] % 3 == 0) {
				temp = arr[i] / 3;
			} else {
				temp = arr[i] / 3;
				temp++;
			}
			if (temp >= p)
				over++;
			else if (temp == p - 1 && arr[i]>1)
				oneund++;
		}
		over += Math.min(S, oneund);
		return over;
	}

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int T = scan.nextInt();
		int arr[];
		for (int i = 0; i < T; i++) {
			arr = new int[scan.nextInt()];
			int S = scan.nextInt();
			int p = scan.nextInt();
			for (int a = 0; a < arr.length; a++) {
				arr[a] = scan.nextInt();
			}
			System.out.println("Case #" + (i + 1) + ": " + testcase(S, p, arr));
		}
	}
}