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.*;
import java.io.*;

public class Dancing {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int cases = in.nextInt();

		for (int i = 1; i<=cases; i++) {
			int n = in.nextInt(); // number of googlers
			int s = in.nextInt(); // number of surprising triplets
			int p = in.nextInt(); // ??
			
			int[] points = new int[n];
			for (int j = 0; j<n; j++)
				points[j] = in.nextInt();

			// lowest possible unsurprising triplet:
			// p, p-1, p-1

			// lowest possible surprising triplet:
			// p, p-2, p-2

			int answer = 0;
			int possible = 0;
			int lowUn = lowestUnsurprising(p);
			int lowSu = lowestSurprising(p);
			for (int j = 0; j<n; j++) {
				if (points[j] >= lowUn) answer++;
				else if (points[j] >= lowSu) possible++;
			}

			answer += Math.min(possible, s);
			System.out.println("Case #"+i+": "+answer);
		}
	}

	public static int lowestUnsurprising(int p) {
		return p + (Math.max(p-1, 0))*2;
	}

	public static int lowestSurprising(int p) {
		return p + (Math.max(p-2, 0))*2;
	}
}
