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.BufferedInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Scanner;

public class DancingWithTheGooglers {
	private static final boolean DEBUG = false;
	private static final String FILENAME = "dancing";

	public static void main(String[] args) throws IOException {
		long startTime = System.nanoTime();

		if(DEBUG) {
			System.setIn(new BufferedInputStream(new FileInputStream(FILENAME + "_example.in")));
		} else {
			System.setIn(new BufferedInputStream(new FileInputStream(FILENAME + ".in")));
			System.setOut(new PrintStream(FILENAME + ".out"));
		}

		Scanner sc = new Scanner(System.in);

		int numTestCases = sc.nextInt();
		for(int caseNum = 1; caseNum <= numTestCases; caseNum++) {
			int numGooglers = sc.nextInt();
			int numSurprising = sc.nextInt();
			int scoreMaxLowerBound = sc.nextInt();
			
			int numGooglersWithBetter = 0;
			
			for(int i = 0; i < numGooglers; i++) {
				int totalScore = sc.nextInt();
				
				if(totalScore <= 1) {
					if(totalScore >= scoreMaxLowerBound) {
						numGooglersWithBetter++;
					}
				} else {
					int maxScore;
					if(totalScore % 3 == 0) {
						maxScore = totalScore / 3;
					} else {
						maxScore = totalScore / 3 + 1;
					}
					
					if(maxScore >= scoreMaxLowerBound) {
						numGooglersWithBetter++;
					} else if(numSurprising > 0) {
						maxScore++;
						
						if(maxScore >= scoreMaxLowerBound) {
							numGooglersWithBetter++;
							numSurprising--;
						}
					}
				}
			}
			
			System.out.println("Case #" + caseNum + ": " + numGooglersWithBetter);
		}

		if(DEBUG) System.out.println("Total time: " + ((System.nanoTime() - startTime) / 1000.0 / 1000.0 / 1000.0) + "s");
	}
}