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.FileOutputStream;
import java.io.IOException;
import java.util.Scanner;

public class Dancers {

	public static void main(String[] args) throws IOException {
		int T, N, S, p;
		Scanner sc = new Scanner(System.in);
		FileOutputStream out = new FileOutputStream("out.txt");
		T = sc.nextInt(); sc.nextLine();
		for (int i = 0; i < T; i++) {
			int sure = 0, pos = 0;
			N = sc.nextInt(); S = sc.nextInt(); p = sc.nextInt(); 
			for (int j = 0; j < N; j++) {
				int act = sc.nextInt();
				if (act == 0) {
					if (p == 0) sure++;
				} else {
					if (act >= ((p*3)-2)) sure++;
					else if (act >= ((p*3)-4)) pos++;
				}
			}
			int res = Math.min(sure + Math.min(pos, S), N);
			out.write(("Case #" + (i + 1) + ": "+res+"\n").getBytes());
		}

	}

}