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 Start {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner in=new Scanner(System.in);
		int cases=in.nextInt();
		
		for (int x=1;x<=cases;x++){
			int c=0;
			int num=in.nextInt();
			int surp=in.nextInt();
			int best=in.nextInt();
		//	int[] dancer=new int[num];
			for (int y=0;y<num;y++){
				int dummy=in.nextInt();
				int point=dummy/3;
				int rest=dummy%3;
				if(point>=best)c++;
				else if (point+1>=best &&rest>=1)c++;
				else if (point+2>=best&&surp>0&&rest==2){
					c++;
					surp--;
				}
				else if (point+1>=best && surp>0 && point>0){
					c++;
					surp--;
				}
			}
			System.out.println("Case #"+x+": "+c);
		}

	}

}
