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.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 * @throws NumberFormatException 
	 */
	public static void main(String[] args) throws NumberFormatException, IOException {
		
		BufferedReader br= new BufferedReader(new FileReader("C:\\codejam\\B-small-attempt0.in"));
		int cases=Integer.parseInt(br.readLine());
		int i=0;
		FileWriter wr=new FileWriter("c:\\codejam\\output.txt");
		for(;cases>0;cases--)
		{
			StringTokenizer values=new StringTokenizer(br.readLine());
			int n=Integer.parseInt(values.nextToken());
			int s=Integer.parseInt(values.nextToken());
			int p=Integer.parseInt(values.nextToken());
			int c=0;
			int bestscore=p*3-2>0?p*3-2:0;
			int surprisingscore=p*3-4>1?p*3-4:1;

			while(n>0)
			{
				int t=Integer.parseInt(values.nextToken());
				if(bestscore<=t)
				{
					c++;
				}
				else if(s!=0&&surprisingscore<=t)
				{
					s--;
					c++;
				}
				n--;
			}
			i++;
			wr.write("Case #"+i+": "+c+"\n");
		}
		wr.close();

	}

}
