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);
        }
    }
}

package main;

import java.io.*;
import java.util.Scanner;

public class Main {
	static File problemFile = new File(System.getProperty("user.home") + "/Projects/java/CodeJam/DancingWithTheGooglers/B-small-attempt2.in");
	static File solutionFile = new File(System.getProperty("user.home") + "/Projects/java/CodeJam/DancingWithTheGooglers/B-small-attempt2.out");

	public static void main (String[] args) {
		Solver s = new Solver();
		try {
			Scanner input = new Scanner(new FileInputStream(problemFile));
			BufferedWriter outWriter = new BufferedWriter(new FileWriter(solutionFile));

			s.createSolution(input, outWriter);
			
		} catch (IOException e1) {
			// TODO Auto-generated catch block
			e1.printStackTrace();
		}
	}
}

