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.File;
import java.io.FileNotFoundException;
import java.util.Scanner;


public class Dance {
	public static void main(String[] args) throws FileNotFoundException {
		File file = new File("input.in");
		Scanner in = new Scanner(file);
		
		int cases = in.nextInt();
		
		for (int i = 0; i < cases; i++) {
			int N = in.nextInt(); //googlers
			int S = in.nextInt(); //surprising scores
			int p = in.nextInt();
			int [] scores = new int[N];
			for (int j = 0; j < scores.length; j++) {
				scores[j] = in.nextInt();
			}
			int max = 0;
			
			for (int j = 0; j < scores.length; j++) {
				if (scores[j] >= (3*p-2)) {
					max++;
				} else if (scores[j] >= (3*p-4) && S > 0 && !((3*p-4) <= 0) ) {
					max++;
					S--;
				}
			}
			System.out.println("Case #"+ (i+1) + ": " + max);	
		}
	}
}
