package util.graph;

import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.Set;

public class DynDjikstra {
    public static State FindShortest(Node start, Node target) {
        PriorityQueue<Node> openSet = new PriorityQueue<>();
        Set<Node> closedSet = new HashSet<>();
        openSet.add(start);
        while (!openSet.isEmpty()) {
            Node current = openSet.poll();
            for (Edge edge : current.edges) {
                Node end = edge.target;
                if (closedSet.contains(end)) {
                    continue;
                }
                State newState = edge.travel(current.last);
                //if (end.equals(target)) {
                    //return newState;
                //}
                if (openSet.contains(end)) {
                    if (end.last.compareTo(newState)>0) {
                        end.last = newState;
                    }
                } else {
                    openSet.add(end);
                    end.last = newState;
                }
            }
            closedSet.add(current);
            if (closedSet.contains(target)) {
                return target.last;
            }
        }

        return target.last;
    }
}

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

public class test2
{

	public static void main(String[] args) throws Exception
	{
		new test2().run();
	}

	PrintWriter out = null;

	boolean isOK(int n, int p, boolean s)
	{
		int a = n / 3;
		if (n % 3 != 0)
			a++;

		if (a >= p)
			return true;

		if (s)
		{
			return 3 * p - 4 <= n;
		}

		return false;
	}

	void run() throws Exception
	{
		Scanner in = new Scanner(System.in);
		out = new PrintWriter(new FileWriter("codejam.txt"));

		int T = in.nextInt();
		for (int i = 0; i < T; i++)
		{
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();

			int[] scores = new int[N];
			for (int j = 0; j < N; j++)
				scores[j] = in.nextInt();

			Arrays.sort(scores);
			int total = 0;
			for (int j = N - 1; j >= 0; j--)
			{
				if (isOK(scores[j], p, false))
					total++;
				else
				{
					if (S > 0 && p >= 2)
					{
						if (isOK(scores[j], p, true))
						{
							total++;
							S--;
						}
						else
							break;
					}
					else
						break;
				}
			}

			out.printf("Case #%d: %d\n", i + 1, total);
		}
		out.close();
	}
}
