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

public class B {

	private static Scanner in = new Scanner(System.in);

	private static void solve(int no) {
		int N = in.nextInt();
		int S = in.nextInt();
		int p = in.nextInt();

		int ans = 0;
		for (int i = 0; i < N; i++) {
			int sum = in.nextInt();
			int avr = sum / 3;
			int rem = sum % 3;
			switch (rem) {
			case 0:
				if (avr >= p) {
					ans++;
				} else if (S > 0 && avr > 0 && avr + 1 >= p) {
					ans++;
					S--;
				}
				break;
			case 1:
				if (avr + 1 >= p) {
					ans++;
				}
				break;
			case 2:
				if (avr + 1 >= p) {
					ans++;
				} else if (S > 0 && avr + 2 >= p) {
					ans++;
					S--;
				}
				break;
			}
		}
		System.out.printf("Case #%d: %d%n", no, ans);
	}

	public static void main(String[] args) {
		int T = in.nextInt();
		for (int i = 0; i < T; i++) {
			solve(i + 1);
		}
	}

}
