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 Dance
{
    public static void main(String[] args) throws IOException
    {
        Scanner in = new Scanner(new File("B-small-attempt0.in"));
        PrintWriter out = new PrintWriter(new File("dance_small.in"));
        //Scanner in = new Scanner(System.in);

        int runs = Integer.parseInt(in.nextLine().trim());
        int count = 0;
        while(++count <= runs)
        {
            out.print("Case #" + count + ": ");
            int n = in.nextInt();
            int s = in.nextInt();
            int p = in.nextInt();
            int[] scores = new int[n];
            
            for(int i = 0; i < n; i++)
                scores[i] = in.nextInt();
            
            int min = Math.max(p, (p*3)-2);
            int surprise = Math.max(p, (p*3)-4);
            
            int num = 0;
            for(int i = 0; i < n; i++) {
                if(scores[i] >= min)
                    num++;
                else if(scores[i] >= surprise && s > 0) {
                    num++;
                    s--;
                }
            }
            
            out.println(num);
        }
        
        out.close();
    }
}
