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.*;
import java.io.*;

public class dancing {
    public static void main(String[] args) throws Throwable {
	Scanner input=new Scanner(new File("dancing.in"));
	PrintWriter out=new PrintWriter(new File("dancing.out"));
	int cases=input.nextInt();
	for(int test=1;test<=cases;test++) {
	    int n=input.nextInt();
	    int s=input.nextInt();
	    int p=input.nextInt();
	    int[] t=new int[n];
	    for(int i=0;i<n;i++) t[i]=input.nextInt();
	    int numNS=0, numS=0;
	    for(int i=0;i<n;i++) {
		if(t[i]/3+(t[i]%3==0?0:1)>=p) numNS++;
		}
	    for(int i=0;i<n;i++) {
		if(t[i]<2) {
		    if(t[i]>=p) numS++;
		    }
		else {
		    if((t[i]-2)/3+2>=p) numS++;
		    }
		}
	    int ans=numNS+Math.min(numS-numNS, s);
	    out.println("Case #"+test+": "+ans);
	    }
	out.close();
	}
    }