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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Arrays;
import java.util.Collections;

public class DancingWithGooglers {

	public static void main(String[] args) throws IOException{
		FileReader inf = new FileReader("data/B-small.in"); 
		BufferedReader in = new BufferedReader(inf); 
		FileWriter outf = new FileWriter("result/B-small.out");  
		BufferedWriter out = new BufferedWriter(outf);  
		int numCases = Integer.parseInt(in.readLine());  
		int numGoogler = 0;
		int numSuprising = 0;
		int p = 0;
		int maxResult = 0;
		
		for(int index = 1; index <=numCases; index++)
		{
			/*Begin to get data*/
			String line = in.readLine();  
			String []tokens = line.split(" ");
			numGoogler = Integer.parseInt(tokens[0]);
			numSuprising = Integer.parseInt(tokens[1]);
			p = Integer.parseInt(tokens[2]);
			Integer [] scores = new Integer[numGoogler];
			int k = 0;
			maxResult = 0;
			for(int i = 3; i < tokens.length; i++)
			{
				scores[k++] = Integer.parseInt(tokens[i]);
			}
			/*End of getting data*/
			
			/*Reverse the order*/
			Arrays.sort(scores, Collections.reverseOrder());
			for(int i = 0; i < scores.length;i++)
			{
				if(scores[i] >= 3*p)
				{
					maxResult++;
				}
				else if(scores[i] < p)
				{
					continue;
				}
				else if((scores[i]>=(3*p - 2)) && (scores[i]<= (3*p -1)))
				{
					maxResult++;
				}
				else if((scores[i]>=(3*p - 4)) && (3*p - 4) > 0)
				{
					if(numSuprising > 0)
					{
						maxResult ++;
						numSuprising--;
					}
				}
				else
				{
					continue;
				}
			}
			System.out.println("Case #"+index+": "+maxResult);
			out.write("Case #"+index+": "+" "+maxResult);
			out.newLine();
			out.flush();
		}
		
	}
	
}
