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

package codejam;

import java.io.*;
import java.util.*;

public class DancingWithGooglers {
	
	public static void main(String[] args) throws IOException {
		BufferedReader inp = new BufferedReader(new InputStreamReader(System.in));
		int noOfTestCases = Integer.parseInt(inp.readLine());
		StringTokenizer str;
		int noOfGooglers;
		int noOfSurprises;
		int bandWidth;
		int currScore;
		ArrayList<Integer> results = new ArrayList<Integer>();
		
		for(int i=0;i<noOfTestCases;i++)
		{
			int num = 0;
			str = new StringTokenizer(inp.readLine());
			noOfGooglers = Integer.parseInt(str.nextToken());
			noOfSurprises = Integer.parseInt(str.nextToken());
			bandWidth = Integer.parseInt(str.nextToken());
			if(bandWidth == 0)
			{
				results.add(noOfGooglers);
				continue;
			}
			for(int j=0;j<noOfGooglers;j++)
			{
				 currScore = Integer.parseInt(str.nextToken());
				 if(currScore > (bandWidth - 1)*3)
				 {
					 num++;
					 continue;
				 }
				 if(bandWidth == 1)
					 continue;
				 if(noOfSurprises > 0 && currScore > ((bandWidth - 2)*3 + 1))
				 {
					 num++;
					 noOfSurprises--;
				 }
			}
			results.add(num);
		}
		
		ListIterator<Integer> itr = results.listIterator();
		int i=1;
		while(itr.hasNext())
		{
			System.out.println("Case #" + i + ": " + itr.next());
			i++;
		}
	}
}
