package com.example;

import java.io.IOException;
import java.util.List;

public class ProblemB {
    
    enum Result {
	INSUFFICIENT,
	SUFFICIENT,
	SUFFICIENT_WHEN_SURPRISING
    }

    public static void main(String[] a) throws IOException {

	List<String> lines = FileUtil.getLines("/B-large.in");
	
	int cases = Integer.valueOf(lines.get(0));
	
	for(int c=0; c<cases; c++) {
	    String[] tokens = lines.get(c+1).split(" ");
	    
	    int n = Integer.valueOf(tokens[0]); // N = number of Googlers
	    int s = Integer.valueOf(tokens[1]); // S = number of surprising triplets
	    int p = Integer.valueOf(tokens[2]); // P = __at least__ a score of P
	    
	    int sumSufficient = 0;
	    int sumSufficientSurprising = 0;
	    
	    for(int i=0; i<n; i++) {
		int points = Integer.valueOf(tokens[3+i]);
		
		switch(test(points, p)) {
		case SUFFICIENT:
		    sumSufficient++;
		    break;
		    
		case SUFFICIENT_WHEN_SURPRISING:
		    sumSufficientSurprising++;
		    break;
		}
		
//		uSystem.out.println("points "+ points +" ? "+ p +" => "+ result);
	    }
	    
	    System.out.println("Case #"+ (c+1) +": "+ (sumSufficient + Math.min(s, sumSufficientSurprising)));
	    
//	    System.out.println();
//	    System.out.println("N="+ n +", S="+ s +", P="+ p);
//	    System.out.println();
	}
    }

    private static Result test(int n, int p) {
	int fac = n / 3;
	int rem = n % 3;
	
	if(rem == 0) {
	    
//	    int triplet0[] = { fac, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac > 0 && fac < 10) {
		
		if(fac+1 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
		
//		int triplet1[] = { fac+1, fac, fac-1 }; // surprising 
//		print(n, triplet1);
	    }
	    
	    
	} else if(rem == 1) {
	    
//	    int triplet0[] = { fac+1, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
//	    if(fac > 0 && fac < 10) {
//		int triplet1[] = { fac+1, fac+1, fac-1 };
//		print(n, triplet1);
//	    }
	    
	} else if(rem == 2) {
	    
//	    int triplet0[] = { fac+1, fac+1, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac < 9) {
//		int triplet1[] = { fac+2, fac, fac }; // surprising
//		print(n, triplet1);

		if(fac+2 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
	    }
	    
	} else {
	    throw new RuntimeException("error");
	}
	
	return Result.INSUFFICIENT;
//	System.out.println();
//	System.out.println(n +" => "+ div3 +" ("+ rem +")");
    }
    
//    private static void print(int n, int[] triplet) {
//	System.out.println("n="+ n +" ("+ (n/3) +","+ (n%3) +") => ["+ triplet[0] +","+ triplet[1] +","+ triplet[2] +"]" + (triplet[0]-triplet[2] > 1 ? " *" : ""));
//    }
    
}

package fixjava;

import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map.Entry;
import java.util.Set;

/**
 * Simple multimap class. <code>
  
  		MultiMap<String, String> map = MultiMapKeyToSet.make();
		map.put("a", "x");
		map.put("a", "x");
		map.put("a", "y");
		map.put("b", "z");
		System.out.println(Join.joinRecursive(map.entrySet(), ", ", "[", "]"));
		
  </code>
 * 
 * @author luke
 */
public class MultiMapKeyToSet<S, T> {

	HashMap<S, HashSet<T>> map = new HashMap<S, HashSet<T>>();

	public static <K, V> MultiMapKeyToSet<K, V> make() {
		return new MultiMapKeyToSet<K, V>();
	}

	/** Return true if this multimap did not already contain the specified value at the specified key. */  
	public boolean put(S key, T value) {
		HashSet<T> set = map.get(key);
		if (set == null) {
			set = new HashSet<T>();
			map.put(key, set);
		}
		return set.add(value);
	}

	public void putAll(S key, Iterable<T> values) {
		boolean putSomething = false;
		for (T val : values) {
			put(key, val);
			putSomething = true;
		}
		if (!putSomething && !map.containsKey(key))
			// If putting an empty collection, need to create an empty set at the key 
			map.put(key, new HashSet<T>());
	}

	public void putAll(S key, T[] values) {
		if (values.length == 0 && !map.containsKey(key))
			// If putting an empty collection, need to create an empty set at the key 
			map.put(key, new HashSet<T>());
		else
			for (T val : values)
				put(key, val);
	}

	public HashSet<T> get(S key) {
		return map.get(key);
	}

	/**
	 * Get the single value mapped to by the key, or null if no value mapped to for this key.
	 * 
	 * @throws IllegalRuntimeException
	 *             if there is more than one value mapped to by this key.
	 */
	public T getSingleVal(S key) {
		HashSet<T> set = map.get(key);
		return CollectionUtils.getSingleVal(set);
	}

	public boolean containsKey(S key) {
		return map.containsKey(key);
	}

	public int sizeKeys() {
		return map.size();
	}

	public Set<Entry<S, HashSet<T>>> entrySet() {
		return map.entrySet();
	}

	/**
	 * Return the union of all values in all mapped sets (i.e. the union of all values mapped to by some key in this MultiMap).
	 * NOTE: creates a new HashSet with the current union on every invocation, so if you modify the contents of the returned
	 * HashSet, it won't affect the map.
	 */
	public HashSet<T> valuesUnion() {
		return CollectionUtils.union(map.values());
	}

	public HashMap<S, HashSet<T>> getRawMap() {
		return map;
	}

	public Set<S> keySet() {
		return map.keySet();
	}

	/** Invert the mapping */
	public MultiMapKeyToSet<T, S> invert() {
		MultiMapKeyToSet<T, S> inv = new MultiMapKeyToSet<T, S>();
		for (Entry<S, HashSet<T>> ent : map.entrySet()) {
			S key = ent.getKey();
			for (T val : ent.getValue())
				inv.put(val, key);
		}
		return inv;
	}

	public ArrayList<Pair<S, HashSet<T>>> toList() {
		ArrayList<Pair<S, HashSet<T>>> result = new ArrayList<Pair<S,HashSet<T>>>();
		for (Entry<S, HashSet<T>> ent : map.entrySet())
			result.add(Pair.make(ent.getKey(), ent.getValue()));
		return result;
	}
	
	/** Write out to a TSV file */
	public void writeOutToFile(String tsvFile) throws IOException {
		PrintWriter writer = new PrintWriter(tsvFile);
		for (Entry<S, HashSet<T>> ent : map.entrySet()) {
			S key = ent.getKey();
			StringBuilder buf = new StringBuilder();
			buf.append(key);
			for (T val : ent.getValue())
				buf.append("\t" + val);
			writer.println(buf.toString());
		}
		writer.close();
	}
	
	/** Read in a String->String map from a TSV file */
	public static MultiMapKeyToSet<String, String> readFromFile(String tsvFile) throws IOException {
		MultiMapKeyToSet<String, String> map = new MultiMapKeyToSet<String, String>();
		for (String line : new FileLineIterator(tsvFile)) {
			String[] parts = Split.split(line, "\t");
			String key = parts[0];
			for (int i = 1; i < parts.length; i++)
				map.put(key, parts[i]);
		}
		return map;
	}
}
