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 b {

	public static void main(String[] args) {

		Scanner fin = new Scanner(System.in);

		int numCases = fin.nextInt();

		for (int loop=1; loop<=numCases; loop++) {

			int numPeople = fin.nextInt();
			int numSurprise = fin.nextInt();
			int threshold = fin.nextInt();

			int safe = 0;
			int surprise = 0;
			int lost = 0;
			int either = 0;

			for (int i=0; i<numPeople; i++) {

				int next = fin.nextInt();
				if (threshold >= 2) {

					if (next >= 3*threshold - 2)
						safe++;
					else if (next >=  3*threshold - 4)
						surprise++;
					else
						lost++;
				}
				else {
					if (threshold == 0)
						safe++;
					else {
						if (next >= 1)
							safe++;
						else
							lost++;
					}

				}
			}

			System.out.println("Case #"+loop+": "+(safe+Math.min(surprise, numSurprise)));
		}
	}
}