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

public class Dance {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		int numCases = Integer.parseInt(br.readLine());
		for ( int i = 1; i <= numCases; i++ ) {
			String[] c = br.readLine().split(" ");
			int googlers = Integer.parseInt(c[0]);
			int exceptions = Integer.parseInt(c[1]);
			int target = Integer.parseInt(c[2]);
			int hits = 0;
			int potentials = 0;
			for ( int j = 3; j < (googlers + 3); j++ ) {
				int val = Integer.parseInt(c[j])
					, avg = val/3
					, mod = val%3
					, max = avg + (mod == 2 ? 2 : 1)
					, normalMax = (mod == 0 ? avg : avg + 1)
				;
				//				System.out.println("Checking " + val + " with avg " + avg + " and mod " + mod + " and max " + max + " and normal max " + normalMax);
				if ( (val == 0 && target > 0) || max < target ) {
					continue; // Unobtainable, discard
				}
				else if ( normalMax >= target ) {
					hits++;
				}
				else {
					potentials++;
				}
			}
			System.out.println("Case #" + i + ": " + (hits + (exceptions >= potentials ? potentials : exceptions)));
		}
	}
}