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.util.*;
import java.io.*;
import static java.lang.Math.*;

public class B {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("C:/Users/Farnoosh/Desktop/B-small.in"));
		FileWriter fw = new FileWriter("C:/Users/Farnoosh/Desktop/B-small.out");
		/*BufferedReader in = new BufferedReader(new FileReader("B-large.in"));
		FileWriter fw = new FileWriter("B-large.out");*/
		
		int N = 0;
		int S = 0;
		int P = 0;
		int num1 = 0;
		
		int Num = new Integer(in.readLine());
		for (int cases = 1; cases <= Num; cases++) 
		{	
			int count = 0;
			String[] ss = in.readLine().split(" ");
			N = Integer.parseInt(ss[0]);
			S = Integer.parseInt(ss[1]);
			P = Integer.parseInt(ss[2]);
			
			for(int i = 0 ; i < N ; i++){
				num1 = Integer.parseInt(ss[i+3]);
				
				if (P == 0 && num1 == 0){
					count++;
					continue;
				}
				if (num1 < Math.abs(P+2*(P-2)))
				{
					continue;
				}
				else if(num1 >= (P+2*(P-1)))
				{
					count++;
				}
				else {
					if (S > 0){
						count++;
						S--;
					}
				}// end of else
			}// end of for		 
			fw.write ("Case #" + cases + ": " + count + "\n");
		}
		fw.flush();
		fw.close();
	}

}