/**
 * 
 */
package pandit.codejam;

import java.io.BufferedInputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.Scanner;

/**
 * @author Manu Ram Pandit
 * 
 */
public class DancingWithGooglersUpload {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		FileInputStream fStream = new FileInputStream(
				"input.txt");

		Scanner scanner = new Scanner(new BufferedInputStream(fStream));
		Writer out = new OutputStreamWriter(new FileOutputStream("output.txt"));

		int T = scanner.nextInt();
		int N,S,P,ti;
		int counter = 0;
		for (int count = 1; count <= T; count++) {
			N=scanner.nextInt();
			S = scanner.nextInt();
			counter = 0;
			P = scanner.nextInt();
			for(int i=1;i<=N;i++){
				ti=scanner.nextInt();
				if(ti>=(3*P-2)){
					counter++;
					continue;
				}
				else if(S>0){
					if(P>=2 && ((ti==(3*P-3)) ||(ti==(3*P-4)))) {
					S--;
					counter++;
					continue;
					}
				}
				
			}
			// System.out.println("Case #" + count + ": " + counter);
			out.write("Case #" + count + ": " + counter + "\n");
		}
		fStream.close();
		out.close();

	}

}

import java.io.*;
import java.util.*;
public class Main
{
	public static void main(String[] args)throws IOException
	{
		new Main().start();
	}
	public void start()throws IOException
	{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st;
		int test=Integer.parseInt(br.readLine());
		int ind=1;
		
		while(test-->0)
		{
			st=new  StringTokenizer(br.readLine());
			int ans=0;
			int N=Integer.parseInt(st.nextToken());
			int S=Integer.parseInt(st.nextToken());
			int p=Integer.parseInt(st.nextToken());
			int totalScore[]=new int[N];
			for(int i=0;i<N;i++)
			{
				totalScore[i]=Integer.parseInt(st.nextToken());
			}
			if(p==0)
			{
				ans=N;
				System.out.println("Case #"+ind+": "+ans);
				ind++;
				continue;
			}
			if(p==1)
			{
				ans=0;
				for(int i=0;i<N;i++)
					if(totalScore[i]!=0)
						ans++;
				System.out.println("Case #"+ind+": "+ans);
				ind++;
				continue;
			}
			Arrays.sort(totalScore);
			boolean cons[]=new boolean[N];
			int max=3*p-4;
			for(int i=0;i<N && S>0;i++)
			{
				if(totalScore[i]>=max)
				{
					ans++;
					cons[i]=true;
					S--;
				}
			}
			max=3*p-2;
			for(int i=0;i<N;i++)
			{
				if(totalScore[i]>=max && !cons[i])
					ans++;
			}
			System.out.println("Case #"+ind+": "+ans);
			ind++;
		}
	}
}