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.*;
public class GoogJam2
{
	public static void main(String args[])
	{
	try{
	
	BufferedReader br=new BufferedReader(new FileReader(args[0]));
		int T=Integer.parseInt(br.readLine());
		BufferedWriter bw=new BufferedWriter(new FileWriter("output.txt",true));
	for(int i1=0;i1<T;i1++)
	{
	String st=br.readLine();
	String sam[]=st.split(" ");
	int N=Integer.parseInt(sam[0]);
	int s=Integer.parseInt(sam[1]);
	int p=Integer.parseInt(sam[2]);
	int a[]=new int[N];

	for(int k=0;k<N;k++)
	{a[k]=Integer.parseInt(sam[k+3]);
	}	
	int b[][]=new int[N][2];
	int count=0;
	for(int i=0;i<N;i++)
	{
	b[i][0]=a[i]/3;
	b[i][1]=a[i]%3;
	//System.out.println(b[i][0]+" "+b[i][1]+"\n");
	}
	
	for(int i=0;i<N;i++)
	{	
	if((b[i][0]>=p)||((b[i][0]==p-1)&&(b[i][1]==1))||((b[i][0]==p-1)&&(b[i][1]==2)))
	{//System.out.println("c1");
	count++;
	}
	else if(s>0)
	{
			if((b[i][0]==p-1)&&(b[i][1]==0))
			{if(a[i]>=1)
				{//System.out.println(b[i][0]+" c2");
				count++;
				s--;
				}
			}
			else if((b[i][0]==p-2)&&(b[i][1]==2))
			{//System.out.println(b[i][0]+" "+b[i][1]+"\n");
				if(a[i]>=2)
				{//System.out.println(b[i][0]+" c2");
				count++;
				s--;
				}
			}
	}
	}
	bw.write("Case #"+(i1+1)+": "+count+"\n");
	//System.out.println(count);
	}
	bw.close();
	br.close();
	}
	catch(Exception e)
	{}
	
	}
}