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.ArrayList;
import java.util.Collections;
import java.util.Scanner;


public class b {
	public static void main(String[] args){
		new b().go();
	}

	private void go() {
		Scanner in=new Scanner(System.in);
		int numc=in.nextInt();
		for(int cnum=1;cnum<=numc;cnum++){
			int n=in.nextInt(),s=in.nextInt(),p=in.nextInt();
			ArrayList<Integer>a=new ArrayList<Integer>();
			for(int i=0;i<n;i++)a.add(in.nextInt());
			Collections.sort(a,Collections.reverseOrder());
			int count=0;
			for(int i:a){
				if((i+2)/3>=p&&i>=p)count++;
				else if(s>0&&(i+4)/3>=p&&i>=p){
					count++;
					s--;
				}
			}
			System.out.printf("Case #%d: %d\n", cnum,count);
		}
	}

}