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.FileInputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;

public class B {


	public static void main (String[] args)
	{


		try {
			//BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
			BufferedReader in = new BufferedReader(new InputStreamReader(new FileInputStream(new File("src/B-small-attempt0.in"))));
			PrintWriter pw = new PrintWriter(System.out);
			int cases = Integer.parseInt(in.readLine());	
			for (int i = 0; i < cases; i++) {
				int max=0;
				String[] data = in.readLine().split(" ");
				int N = Integer.parseInt(data[0]);
				int S = Integer.parseInt(data[1]);
				int p = Integer.parseInt(data[2]);
				int[] sums = new int[N];
				for (int j = 0; j < N; j++) {
					sums[j] = Integer.parseInt(data[j+3]);
				}
				if(p==0)
				{
					max=N;
				}
				else if (p==1)
				{
					for (int j = 0; j < sums.length; j++) {
						if(sums[j]>0)
							max++;
					}
				}
				else{
				for (int j = 0; j < sums.length; j++) {
					if(sums[j]>=3*p-2)
						max++;
					else if(sums[j]>=3*p-4 && S>0)
					{
						max++;
						S--;
					}
					
				}
				}

				
				System.out.println("Case #"+(i+1)+": "+max);
			}
			pw.flush();
		}
		catch(Exception e)
		{
			e.printStackTrace();
		}
	}
}
