import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

package fixjava;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;
import java.util.Map.Entry;

public abstract class Filter<T> {

	abstract boolean accept(T item);

	public static <U> ArrayList<U> list(Iterable<U> collection, Filter<U> filter) {
		ArrayList<U> filtered = new ArrayList<U>();
		for (U item : collection)
			if (filter.accept(item))
				filtered.add(item);
		return filtered;
	}

	public static <U> HashSet<U> set(Set<U> set, Filter<U> filter) {
		HashSet<U> filtered = new HashSet<U>();
		for (U item : set)
			if (filter.accept(item))
				filtered.add(item);
		return filtered;
	}

	public static <K, V> HashMap<K, V> mapKeys(Map<K, V> map, Filter<K> keyFilter) {
		HashMap<K, V> filtered = new HashMap<K, V>();
		for (Entry<K, V> ent : map.entrySet())
			if (keyFilter.accept(ent.getKey()))
				filtered.put(ent.getKey(), ent.getValue());
		return filtered;
	}

	public static <K, V> HashMap<K, V> mapValues(Map<K, V> map, Filter<V> valueFilter) {
		HashMap<K, V> filtered = new HashMap<K, V>();
		for (Entry<K, V> ent : map.entrySet())
			if (valueFilter.accept(ent.getValue()))
				filtered.put(ent.getKey(), ent.getValue());
		return filtered;
	}
}
