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 Qualification;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class DancingWithGooglers {
	public static void main(String[] args) throws NumberFormatException,
			IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		int t = Integer.parseInt(in.readLine());
		for (int m = 1; m <= t; m++) {
			String[] S = in.readLine().split(" ");
			int n = Integer.parseInt(S[0]);
			int sur = Integer.parseInt(S[1]);
			int p = Integer.parseInt(S[2]);
			int[] A = new int[n];
			for (int i = 0; i < n; i++)
				A[i] = Integer.parseInt(S[i + 3]);
			int cnt = 0;
			for (int i = 0; i < n; i++)
				if (Math.ceil(A[i] / 3.0) >= p)
					cnt++;
				else if (A[i] >= p && p - (A[i] - p) / 2 == 2 && sur > 0) {
					sur--;
					cnt++;
				}
			System.out.println("Case #" + m + ": " + cnt);
		}
	}
}
