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 DancingWithTheGooglers {
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int t=sc.nextInt();
		for(int i=0;i<t;i++){
			int n=sc.nextInt();
			int s=sc.nextInt();
			int p=sc.nextInt();
			int ans=0;
			for(int j=0;j<n;j++){
				int total=sc.nextInt();
				int score=total/3+((total%3)>0?1:0);
				if(score>=p){
					ans++;
				}else if(s>0 && total>=p){
					int x=(total-p)/2;
					if(x+2>=p){
						s--;
						ans++;
					}
				}
			}
			System.out.println("Case #"+(i+1)+": "+ans);
		}
	}
}
