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)
      {
         try
         {
            Scanner scan = new Scanner(new File("Dancing.in"));
            int x = Integer.parseInt(scan.nextLine());
            for(int y=0;y<x;y++)
            {
               String s=scan.nextLine();
               System.out.println("Case	 #"+(y+1)+": " + convert(s));
            }
         }
            catch(FileNotFoundException e)
            {
               System.out.println("File Not Found");
            }
      }
   
      public static int convert(String t)
      {
         int a=0;
         int b=0;
         int c=0;
         int total=0;
         String[] ar=t.split("[ ]");
         a=Integer.parseInt(ar[0]);
         b=Integer.parseInt(ar[1]);
         c=Integer.parseInt(ar[2]);
         for(int x=3;x<a+3;x++)
         {
            int temp=Integer.parseInt(ar[x]);
            if(temp>=3*c-2)
               total++;
            else if(temp>=3*c-4 && temp != 0)
            {
               if(b>0)
               {
                  b--;
                  total++;
               }
            }
         }
         return total;
      }
   }