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

class Dancer{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int testcase, numdancer, surprise, limit, counter, score;
    testcase = sc.nextInt();
    for(int i=1;i<=testcase;i++){
      counter = 0;
      System.out.print("Case #"+i+": ");
      numdancer = sc.nextInt();
      surprise = sc.nextInt();
      limit = sc.nextInt();
      for(int j=0;j<numdancer;j++){
        score = sc.nextInt();
        if(score==0){
          if(limit==0)
          counter++;
        }
        else if(score==1){
          if(limit <= 1)
          counter++;
        }
        else if(score == 2){
          if(limit<=1)
            counter++;
          else if(limit==2 && surprise>0){
            counter++;
            surprise--;
          }
        }
        else{
          switch(score%3){
            case 0:{
              if(score/3 >= limit)
              counter++;
              else if(surprise>0 && (score/3) + 1 >= limit){
                counter++;
                surprise--;
              }
            
            break;
            }
            case 1:{
              if((score/3)+1 >=limit)
                counter++;
              break;
            }
            case 2:{
              if((score/3)+1>=limit)
                counter++;
              else if(surprise>0 && (score/3)+2>=limit){
                counter++;
                surprise--;
              }
                break;
            }
          }
        }
      }
      System.out.println(counter);
    }
  }
}