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

import java.io.*;
import java.util.Scanner;

public class ProblemB {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException{
		Scanner sc = new Scanner(new FileReader("B.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B.out"));
		int t = sc.nextInt();
		for (int caseNum = 1; caseNum <= t; caseNum++)
		{
			int n = sc.nextInt();
			int s = sc.nextInt();
			int p = sc.nextInt();
			int count = 0;
			for (int i = 0; i<n; i++)
			{
				int pscore = sc.nextInt();
				int score = getScore(pscore);
				if (score>=p)
					count++;
				else if (p-score == 1 && s>0 && pscore >=2)
				{
					s--;
					count++;
				}
			}
			out.println("Case #"+caseNum+": "+count);
		}
		out.close();
	}
	
	public static int getScore(int num)
	{		
		if (num % 3 == 0)
			return num/3;
		else
			return num/3+1;
	}

}
