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.*;
import java.util.*;
import java.math.*;

public class Main implements Runnable
{
	static Scanner scanner;
	static BufferedReader input;
	static PrintWriter pw;

	public static void main(String[] args) throws Exception
	{
		new Thread(new Main()).start();
	}

	public void run()
	{
		try
		{
			input = new BufferedReader(new FileReader("input.txt"));
			scanner = new Scanner(input);
			pw = new PrintWriter(new File("output.txt"));

			solve();
			pw.close();
		}
		catch(Exception e)
		{
			e.printStackTrace();
			System.exit(1);
		}
	}

	public void solve() throws Exception
	{
		int T = scanner.nextInt();
		for(int t = 0; t < T; t++)
		{
			int N = scanner.nextInt(); // the number of Googlers
			int S = scanner.nextInt(); // the number of surprising triplets of scores
			int P = scanner.nextInt(); // Given the total points for each Googler, as well as the number of surprising triplets of scores, what is the maximum number of Googlers that could have had a best result of at least p?

			int [] ti = new int[N];    // the total points of the Googlers.
			for(int i = 0; i < N; i++){
				ti[i]=scanner.nextInt();
			}

			//--- judge

			int r, s; 
			int ans = 0;
			int cand = 0;
			for(int i = 0; i < N; i++){
				r = ti[i]/3;
				s = ti[i]%3;

				if ( s == 0 ) {
					if ( r >= P ) {
						ans++;
					} else if ( r+1 >= P && r-1 >=0 ) {
						cand++;
					} 
				} else if ( s == 1 ) {
					if ( r+1 >= P ) {
						ans++;
					}
				} else {
					if ( r+1 >= P ) {
						ans++;
					} else if ( r+2 >= P ) {
						cand++;
					} 
				}
			}
			ans = ans + Math.min (cand, S);
			pw.println("Case #" + (t+1) + ": " + ans);
		}
	}
}
