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 round0.p2;

import java.io.File;
import java.util.Scanner;

public class Main
{  
  public static void main(final String[] args) throws Exception
  {
    Scanner s = new Scanner(new File("D:\\unsorted\\b.in"));
    int T = s.nextInt();
    
    for (int i = 0; i < T; i++)
    {
      int N = s.nextInt();
      int S = s.nextInt();
      int p = s.nextInt();
      int[] t = new int[N];
      for (int j = 0; j < N; j++)
        t[j] = s.nextInt();
      
      int successes = 0;
      for (int j = 0; j < N; j++)
      {
        if (t[j] >= Math.max(p*3-2, p))
          successes++;
        else if (t[j] >= Math.max(p*3-4, p) && S > 0)
        {
          successes++;
          S--;
        }
      }
      
      System.out.println("Case #"+(i+1)+": "+successes);
    }
  }
}