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;
    }
}

public class DancingWiththeGooglers {
	
	public static void main(String[] args) {
		//initialize();
		java.util.Scanner sc = new java.util.Scanner(System.in);
		int testCases = sc.nextInt();
		sc.nextLine();
		for(int i=0;i<testCases;i++){
			int s,p,n,upperBound,lowerBound;
			
			//int[][] triplet;
			int[] sum;
			//boolean[] processed;
			int count = 0;
			
			n = sc.nextInt();
			s = sc.nextInt();
			p = sc.nextInt();
			
			upperBound = 3*p;
			lowerBound = 3*p-5;
			if(lowerBound < 0)
				lowerBound = 0;
			sum = new int[n];
			//processed = new boolean[n];
			//triplet = new int[n][3];
			
			for(int i1=0;i1<n;i1++){
				sum[i1] = sc.nextInt();
				if(sum[i1] >= upperBound-2){ 
					count++;
					//processed[i1] = true;
				}
				else if(sum[i1] > lowerBound){
					//processed[i1] = true;
					if(s > 0){
						s--;
						count++;
					}		
				}
			}
			
			StringBuffer sb = new StringBuffer("Case #");
			sb.append(i+1);
			sb.append(": ");
			
			sb.append(count);
			System.out.println(sb);
		}
	}
	
}