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 ProblemB {
	public static void main(String[]args) throws FileNotFoundException {
		File file = new File("test.txt");
		Scanner scan = new Scanner(file);
		
		int cases = Integer.parseInt(scan.nextLine());
		
		for(int i=1;i <= cases;i++) {
			int dancers = scan.nextInt();
			int surprise = scan.nextInt();
			int minscore = scan.nextInt();
			int winner = 0;
			for(int j=0;j<dancers;j++) {
				int score = scan.nextInt();
				if(score >= (minscore*3-2)) winner++;
				else if(score >= (minscore*3-4) && surprise!=0 && score!=0) { winner++; surprise--; }
				else;
			}
			if (scan.hasNextLine()) scan.nextLine();
			System.out.println("Case #" + i + ": " + winner);
		}
			
	}
}
