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 DancingGooglers {
	public static void main(String[] args) {
		try {
			Scanner in = new Scanner(new File("C:/Users/Ross/Downloads/B-small-attempt1.in"));
			int T = in.nextInt();
			String out = "";
			for(int i = 0; i < T; i++) {
				int N = in.nextInt();
				int S = in.nextInt();
				int p = in.nextInt();
				int count = 0;
				for(int j = 0; j < N; j++) {
					int t = in.nextInt();
					if(t > 3*p-3) count++;
					else if(S > 0 && t >= 3*p-4 && t != 0) {
						S--;
						count++;
					}
				}
				out += "Case #" + (i+1) + ": ";
				out += count + "\n";
				System.out.println(out);
			}
		}
		catch(Exception e) {
			e.printStackTrace();
		}
	}
}
