import java.io.*;
import java.math.*;
import java.util.*;
import java.text.*;

public class b {
    public static void main(String[] args) {
        Scanner sc = new Scanner(new BufferedInputStream(System.in));

        int T = sc.nextInt();

        for (int casenumber = 1; casenumber <= T; ++casenumber) {

            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();

            int[] ts = new int[n];
            for (int i = 0; i < n; ++i)
                ts[i] = sc.nextInt();

            int thresh1 = (p == 1 ? 1 : (3 * p - 4));
            int thresh2 = (3 * p - 2);

            int count1 = 0, count2 = 0;

            for (int i = 0; i < n; ++i) {
                if (ts[i] >= thresh2) {
                    ++count2;
                    continue;
                }
                if (ts[i] >= thresh1) {
                    ++count1;
                }
            }

            if (count1 > s) {
                count1 = s;
            }

            System.out.format("Case #%d: %d%n", casenumber, count1 + count2);
        }
    }
}

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