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.IOException;
import java.io.InputStreamReader;

/**
 * Google code jam.
 * Qualification Round 2012.
 * Problem B. Dancing With the Googlers
 * 
 * Usage: &lt;app&gt; &lt;input &gt;output
 * 
 * @author sombrabr@gmail.com
 *
 */
public class QualB {
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		
		int cases = new Integer(in.readLine());
		
		run(in, cases);
	}
	
	static void run(BufferedReader in, int cases) throws IOException {
		for(int i=0; i<cases; ++i) {
			String line = in.readLine();

			System.out.print("Case #" + (i+1) + ": ");
			
			String[] parts = line.split(" ");
			
			int j=0;
			int N = Integer.parseInt(parts[j++]); // Number of Googlers
			int S = Integer.parseInt(parts[j++]); // Surprising triplets
			int p = Integer.parseInt(parts[j++]); // Best result base
			
			int tripletScore = p+2*(Math.max(0, p-2)); // Triplet score
			int minimumScore = p+2*(Math.max(0, p-1)); // Minimum score not a triplet
			
			int surprisings = 0; // Total surprisings already found
			
			int googlers = 0; // Count of Googlers with p
			
			for(int k=0; k<N; ++k) {
				int t = Integer.parseInt(parts[j++]); // Total score
				
				if(t>=minimumScore) {
					googlers++;
				} else if(t>=tripletScore && surprisings<S) {
					surprisings++;
					googlers++;
				}
			}
			
			System.out.println(googlers);
		}
	}
}
