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;
    }
}

package test.com;

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Stack;

public class Qual2012B {


	public static void main(String[] args) throws Exception {
		FileInputStream fos = new FileInputStream("c:/sanker/workspace/input2/B-small-attempt0.in");
		BufferedReader buf = new BufferedReader(new InputStreamReader(fos));
		String str = "";
		int S, P, numT, N;

		str = buf.readLine();
		numT = Integer.parseInt(str);
		for(int i=0; i<numT ; i++) {
			str = buf.readLine();
			if(str == null) System.exit(0);
			String[] numbers = str.split(" ");
			N = Integer.parseInt(numbers[0]);
			S = Integer.parseInt(numbers[1]);
			P = Integer.parseInt(numbers[2]);

			int num, count=0, surpriseCnt=0;
			for(int j=3;j<numbers.length;j++) {
				num = Integer.parseInt(numbers[j]);
				if(num == 0) {
					if(num == P) count++;
					continue;
				}
				if(num/3 >= P) {
					count++;
				}else {
					int d1 = num - P;
					int d2 = (P * 2) - 2;
					if(d1 >= d2)
						count++;
					else {
						int d3 = (P * 2) - 4;
						if(d1 >= d3 && surpriseCnt+1 <= S) {
							count++; surpriseCnt++;
						}
				}
			}
			
			}
			System.out.println("Case #"+(i+1)+": "+count);
			
		}
		
	}
	
	

}
