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;

class Main{

	public static void main(String[] args){
		Scanner S= new Scanner(System.in);
		int T= S.nextInt(),i,j; //Variables de Control
		int n,s,p,val; //Variables del Problema
		int score,aux;
		for(i=0;i<T;i++){
			n= S.nextInt();
			s= S.nextInt();
			p= S.nextInt();
			val=0;
			for(j=0;j<n;j++){
				score= S.nextInt();
				aux= (int)(Math.ceil(score/3.0));
				if(aux>=p){
					val++;
				}else if((score%3==2 || score%3==0) && score>1 && score<29 && s>0 && (aux+1)==p){
					val++;
					s--;
				}
			}
			System.out.println("Case #" + (i+1) + ": " + val);
		}
	}

}