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

public class code3 {
    public static void main(String[] args) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        FileWriter fos = new FileWriter("outfile",false);
        BufferedWriter bw = new BufferedWriter(fos);
        int T=Integer.parseInt(br.readLine()), j=1, N , s, p, ti, i , ans ,cancellable;String str[]; 
        for(;T>0;T--,j++)
        {
            str=(br.readLine()).split(" ").clone();
            N= Integer.parseInt(str[0]);
            s= Integer.parseInt(str[1]);
            p= Integer.parseInt(str[2]);
            i=0;
            ans=0;
            cancellable=0;
            while(i<N)
            {
                               
                ti=Integer.parseInt(str[i+3]); i++;
                if(p==1 || p==0)
                {   if(ti>=p)
                        ans++;
                }
                else{
                if(ti == 3*p-4 || ti==3*p-3)
                {
                    if(s!=0)
                    {s--;ans++;cancellable++;}
                        
                }
                else if(ti >= 3*p-2)
                {
                    ans++;
                }
                }    
            }
            if(s>N-cancellable)
                ans=ans-s;
            bw.write("Case #"+j+": "+ans+"\n");
        }
        bw.close();
    }
}