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.BufferedReader;
import java.io.FileReader;
import java.io.PrintWriter;
import java.io.FileWriter;
import java.util.*;

public class B
{	
	public B( String fn)
	{
		try{
			BufferedReader r = new BufferedReader( new FileReader( fn + ".in"));
			PrintWriter w = new PrintWriter( new FileWriter( fn + ".out"));
			int t = Integer.valueOf( r.readLine());
			for( int i = 0; i < t; i++){
				String[] line = r.readLine().trim().split( " ");
				int y = 0;
				int n = Integer.valueOf( line[0]);
				int s = Integer.valueOf( line[1]);
				int p = Integer.valueOf( line[2]);
				for( int j = 3; j < line.length; j++){
					int a = Integer.valueOf( line[j]);
					if( p == 1){
						if( a >= 1)
							y++;
					}else if( a >= p+2*(p-1)){
						y++;
					}else if( s > 0 && a >= p+2*(p-2)){
						s--;
						y++;	
					}
				}
				w.println( "Case #" + (i+1) + ": " + y);
				System.out.println( "Case #" + (i+1) + ": " + y);
			}
			w.close();
			r.close();
		}catch( Exception e){}
	}
	
	public static void main( String[] args) throws Exception
	{
		new B( args[0]);
	}
}