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.util.Scanner;
import java.io.File;
import java.io.FileWriter;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.FileNotFoundException;

public class Dance {

	public static void main(String[] args) 
	{
		File f = new File("B-small-attempt0.in");
		try
		{
			Scanner scan = new Scanner(f);
			
			int lines = Integer.parseInt(scan.nextLine());
			FileWriter fstream = new FileWriter("output.txt");
			BufferedWriter out = new BufferedWriter(fstream);
						
			for(int i=0; i<lines; i++)
			{
				String line = scan.nextLine();
				String[] parts = line.split(" ");
				int N = Integer.parseInt(parts[0]);
				int S = Integer.parseInt(parts[1]);
				int p = Integer.parseInt(parts[2]);
				int[] totals = new int[N];
				for(int j=3;j<3+N;j++)
					totals[j-3] = Integer.parseInt(parts[j]);
				int num = solve(N,S,p,totals);
				out.write("Case #"+(i+1)+": "+num);
				out.newLine();
			}
			out.close();
		}
		catch(FileNotFoundException e)
		{
			e.printStackTrace();
		}
		catch(IOException ex)
		{
			ex.printStackTrace();
		}
		
	}

	private static int solve(int n, int s, int p, int[] totals) 
	{
		int count = 0;
		int countS = 0;
		for(int i: totals)
		{
			if(i>3*(p-1))
				count++;
			else if(countS < s && i>0 && (i==3*(p-1) || i==3*(p-1)-1))
			{
				count++;
				countS++;
			}
				
		}
		return count;
	}

}






