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;
    }
}

package google;

import java.io.FileNotFoundException;
import java.io.IOException;
import java.util.Scanner;

public class Dancing 
{
    public static void main(String[] args) throws FileNotFoundException, IOException 
    {
        IO.changeGoogleIO('B', 0);
        
        Scanner input = new Scanner(System.in);
        
        int T = input.nextInt();
        int N, S, p, min, now;
        int result0;
        String result;
        
        for (int i = 0; i < T; ++i) 
        {
            result = "Case #" + (i + 1) + ": ";
            
            result0 = 0;
            
            N = input.nextInt();
            S = input.nextInt();
            p = input.nextInt();
            min = 3 * (p - 1);
            
            for (int j = 0; j < N; ++j)
            {
                now = input.nextInt();
                
                if (now > min)
                    ++result0;
                else if ((now > (min - 2)) && (now > 0) && (S > 0))
                {
                    ++result0;
                    --S;
                }
            }
            
            result += result0;
            
            System.out.println(result);
        }
    }
}
