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

public class B {

    public static void main(String[] args) throws Throwable {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        int numCases = Integer.parseInt(reader.readLine());

        for (int c = 1; c <= numCases; c++) {
            System.out.println("Case #" + c + ": " + solveCase(reader.readLine()));
        }
    }

    private static int solveCase(String line) {
        String[] tokens = line.split(" ");
        int numGooglers = Integer.parseInt(tokens[0]);
        int surprisingTriplets = Integer.parseInt(tokens[1]);
        int p = Integer.parseInt(tokens[2]);
        int[] results = new int[numGooglers];
        for (int i = 0; i < numGooglers; i++) {
            results[i] = Integer.parseInt(tokens[i + 3]);
        }

        int num = 0;

        for (int i = 0; i < numGooglers; i++) {
            int res = results[i];
            int lowestScore = res / 3;
            int highestScore = lowestScore;
            int remainder = res - lowestScore * 3;
            if (remainder > 0) {
                highestScore++;
            }
            if (highestScore >= p) {
                num++;
            } else if (surprisingTriplets > 0) {
                switch (remainder) {
                case 0: // 222 -> 123
                    if (lowestScore > 0 && highestScore + 1 >= p) {
                        num++;
                        surprisingTriplets--;
                    }
                    break;
                case 1: // 223 -> 133
                    if (lowestScore > 0 && highestScore >= p) {
                        num++;
                        surprisingTriplets--;
                    }
                    break;
                case 2: // 233 -> 224
                    if (highestScore + 1 >= p) {
                        num++;
                        surprisingTriplets--;
                    }
                    break;
                }
            }
        }
        return num;
    }
}
