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 gcj2012.qual;

import java.util.Scanner;

public class B_DancingWithGooglers 
{
	public static void main(String[] args) 
	{
		Scanner sc = new Scanner(System.in);
		
		int t = sc.nextInt();
		
		for(int cases=1; cases<=t; cases++)
		{
			int players = sc.nextInt();
			int surprising = sc.nextInt();
			int limit = sc.nextInt();
			
			int count = 0;
			
			for(int i=0; i<players; i++)
			{
				int score = sc.nextInt();
				
				if(score < limit)
				{
					continue;
				}
				
				score = (score - limit) / 2;
				
				if(limit - score <= 1)
				{
					count ++;
				}
				else if(surprising > 0 && limit - score <= 2)
				{
					count ++;
					surprising --;
				}
			}
			
			System.out.println("Case #"+cases+": "+count);
		}
	}
}
