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 B {
	
	public static void main(String[] args) {
		
		Scanner in = new Scanner(System.in);
		
		int T = in.nextInt(); in.nextLine();		
		
		//build auxiliary arrays
		int[] without = new int[31];
		int[] with = new int[31];
		for (int i = 0; i <= 30; i++)
		{
			without[i] = (int)Math.ceil((double)i/3.0);
			
			if (i == 0) with[i] = 0;
			else with[i] = (int)Math.min(10, Math.ceil(((double)i+2.0)/3.0));
		}	
		
		//for each test case
		for (int i = 1; i <= T; i++)
		{
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			
			int result = 0;
			
			for (int j = 0; j < N; j++)
			{
				int tp = in.nextInt();
				
				if (without[tp] >= p) result++;
				else if (with[tp] >= p && S > 0)
				{
					result++;
					S--;
				}
			}			
			
			System.out.format("Case #%d: %d\n", i, result);
		}
	}
}