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.util.Scanner;
class abc {
    public static void main (String argv []) {
        Scanner in = new Scanner(System.in);
        int t = in.nextInt();
        for (int j=1;j<=t;j++) {
            int n = in.nextInt();
            int s = in.nextInt();
            int p = in.nextInt();
            p=p*3;
            int ans=0;
            for (int i=0;i<n;i++) {
                int temp = in.nextInt();
                if (temp>=p-4) {
                    if (temp>p-3) {
                        ans++;
                    } else {
                        if (s>0 && (p!=3 || temp!=0)) {
                            s--; ans++;
                        }
                    }
                }
            }
            System.out.println("Case #"+j+": "+ans);
        }
    }
}