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.util.*;


public class Googlers {
	public static void main(String[] args) throws Throwable{
		Scanner scan = new Scanner(new File("in_b"));
		scan.nextLine();
		
		int l = 1;
		while(scan.hasNextLine()){
			String[] line = scan.nextLine().split(" ");
			int surprise = Integer.valueOf(line[1]);
			int p = Integer.valueOf(line[2]);
			int min = (p * 3) - 2;
			int sup = min - 2;
			
			int ok = 0;
			for(int i = 3; i < line.length ; i++){
				int score = Integer.valueOf(line[i]);
				if(p == 1){
					if(score == 0){
						continue;
					}
				}
				if(score >= min){
					ok++;
					continue;
				}
				if(score >= sup){
					if(surprise > 0){
						ok++;
						surprise--;
					}
				}
			
			}
			System.out.println("Case #" + l + ": " + ok);
			l++;
 		}
	}
}
