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.File;
import java.util.HashMap;
import java.util.Map;
import java.util.Properties;
import java.util.Scanner;

public class B {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws Exception {
		// TODO Auto-generated method stub

		// bug eliminator

		Scanner in = new Scanner(new File("d:\\b.small.in"));// new Scanner(new
															// File("d:\\b.small.in"));
		// in = new Scanner(new File("d:\\Minimum Scalar Product-big.in"));

		int people, surp, max,cutter, dangers, certainty;
		int[] scores;

		int testCases = in.nextInt();
		in.nextLine();
		for (int cas = 1; cas <= testCases; cas++) {

			int ans = 0;

			people = in.nextInt();
			scores = new int[people];
			surp = in.nextInt();
			max = in.nextInt();
			cutter = max*3;

			for (int i = 0; i < people; i++)
				scores[i] = in.nextInt();

//			in.nextLine();// eat linedelim

			dangers = 0;
			certainty = 0;
			for (int i = 0; i < people; i++) {
				if (scores[i] >= cutter - 2) {
					certainty++;
				} else if (scores [i] >= cutter - 4&&cutter - 4>=0) {
					dangers++;
				}
			}
//			System.out.println("m"+max+"c"+cutter+"c"+certainty+"d"+dangers+"s"+surp);
			ans = certainty;
			ans+= dangers > surp ? surp : dangers;

			System.out.printf("Case #%d: %d\n", cas, ans);
		}

	}

}
