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.Scanner;


public class qualifier2 {
public static void main(String[] args)
{
	Scanner sc = new Scanner(System.in);
	int numcases = sc.nextInt();
	sc.nextLine();
	for(int curcase = 1;curcase <=numcases;curcase++)
	{
		int numgoog = sc.nextInt();
		int supr = sc.nextInt();
		int cutoff = sc.nextInt();
		int[] scrtot = new int[numgoog];
		for(int i=0;i<numgoog;i++)
		{
			scrtot[i] = sc.nextInt();
		}
		sc.nextLine();
		int count =0;
		for(int i=0;i<numgoog;i++)
		{
			if(cutoff*3 -2 <=scrtot[i])
			{
				count++;
			}else
			{
				if((cutoff*3-4<=scrtot[i])&&(supr>0)&&(scrtot[i]!=0))
				{
				count++;
				supr--;
				}
			}
		}
		System.out.println("Case #"+curcase+": "+count);
	}
}
}
