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

import java.util.Scanner;

public class ProblemB {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int numberOfCases = sc.nextInt();
		for (int i = 0; i <= numberOfCases; i++) {
			int googlers = sc.nextInt();
			int suprisingTriplets = sc.nextInt();
			int p = sc.nextInt();
			int sum = 0;
			for (int j = 0; j < googlers; j++) {
				int points = sc.nextInt();
				if (p == 0) {
					sum++;
				} else if (p == 1) {
					if (points >= 1)
						sum++;
					else
						continue;
				} else if (points >= p * 3) {
					sum++;
				} else if ((p * 3 - points) <= 2) {
					sum++;
				} else if ((p * 3 - points) <= 4 && suprisingTriplets > 0) {
					sum++;
					suprisingTriplets--;
				}
			}
			System.out.println(String.format("Case #%d: %d", i + 1, sum));
		}
	}
}
