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;


public class QualB
{
	public static void main(String args[])
	{
		Scanner kb = new Scanner(System.in);
		
		int ntc = kb.nextInt();
		for(int tc=0;tc<ntc;tc++)
		{
			int n = kb.nextInt();
			int s = kb.nextInt();
			int p = kb.nextInt();
			int ti;
			int sc = 0;
			int y = 0;
			for(int t=0;t<n;t++)
			{
				ti = kb.nextInt();
				if(ti >= 3*p-2)
				{
					y++;
				}
				else if(ti >= 3*p-4 && ti >= p && sc<s)
				{
					y++;
					sc++;
				}
			}
			System.out.println("Case #" + (tc+1) + ": " + y);
		}
	}
}
