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.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Set;
import java.util.Map.Entry;

public class HashMapDualKey<K1, K2, V> extends HashMap<K1, HashMap<K2, V>> {
	private static final long serialVersionUID = 1L;

	/** Returns whether the dual map contains the given key in the K1 space */
	@Override
	public boolean containsKey(Object key) {
		return this.containsKey(key);
	}

	public boolean containsKey(K1 key1, K2 key2) {
		HashMap<K2, V> map2 = this.get(key1);
		if (map2 == null)
			return false;
		else
			return map2.containsKey(key2);
	}

	/** Searches all (K1, K2) pairs to see if any of them map to the value. Runs in O(K1) time. */
	public boolean containsValueAll(Object value) {
		for (HashMap<K2, V> map2 : this.values())
			if (map2 != null && map2.containsValue(value))
				return true;
		return false;
	}

	public V get(K1 key1, K2 key2) {
		HashMap<K2, V> map2 = this.get(key1);
		if (map2 == null)
			return null;
		else
			return map2.get(key2);
	}

	public Set<K2> keySet(K1 key1) {
		HashMap<K2, V> map2 = this.get(key1);
		if (map2 == null)
			return null;
		else
			return map2.keySet();
	}

	public V put(K1 key1, K2 key2, V value) {
		HashMap<K2, V> map2 = this.get(key1);
		if (map2 == null)
			this.put(key1, map2 = new HashMap<K2, V>());
		return map2.put(key2, value);
	}

	public void putAll(ArrayList<Tuple3<? extends K1, ? extends K2, V>> items) {
		for (Tuple3<? extends K1, ? extends K2, V> item : items)
			put(item.getField0(), item.getField1(), item.getField2());
	}

	public void putAllListOfLists(ArrayList<Pair<? extends K1, ArrayList<Pair<? extends K2, V>>>> listOfLists) {
		for (Pair<? extends K1, ArrayList<Pair<? extends K2, V>>> pair1 : listOfLists) {
			K1 k1 = pair1.getLeft();
			for (Pair<? extends K2, V> pair2 : pair1.getRight())
				put(k1, pair2.getLeft(), pair2.getRight());
		}
	}

	@Override
	public HashMap<K2, V> remove(Object key1) {
		return this.remove(key1);
	}

	public V remove(K1 key1, K2 key2) {
		HashMap<K2, V> map2 = this.get(key1);
		if (map2 == null)
			return null;
		V ret = map2.remove(key2);
		if (map2.isEmpty())
			this.remove(key1);
		return ret;
	}

	/** Returns size across all (K1, K2) pairs. Runs in O(K1) time. */
	public int sizeAll() {
		int size = 0;
		for (HashMap<K2, V> map2 : this.values())
			if (map2 != null)
				size += map2.size();
		return size;
	}

	/** Returns union of values across all (K1, K2) pairs. Runs in O(N) time. */
	public HashSet<V> valuesAll() {
		HashSet<V> values = new HashSet<V>();
		for (HashMap<K2, V> map2 : this.values())
			if (map2 != null)
				values.addAll(map2.values());
		return values;
	}

	/** Returns the map as a list of Tuple3<K1, K2, V>. Runs in O(N) time. */
	public ArrayList<Tuple3<K1, K2, V>> getAsList() {
		ArrayList<Tuple3<K1, K2, V>> result = new ArrayList<Tuple3<K1,K2,V>>();
		for (Entry<K1, HashMap<K2, V>> ent1 : this.entrySet()) {
			K1 k1 = ent1.getKey();
			HashMap<K2, V> map2 = ent1.getValue();
			if (map2 != null) {
				for (Entry<K2, V> ent2 : map2.entrySet()) {
					K2 k2 = ent2.getKey();
					V v = ent2.getValue();
					result.add(Tuple3.make(k1, k2, v));
				}
			}
		}
		return result;
	}	

	/** Returns the map as a list of Pair<K1, ArrayList<Pair<K2, V>>>. Runs in O(N) time. */
	public ArrayList<Pair<K1, ArrayList<Pair<K2, V>>>> getAsListOfLists() {
		ArrayList<Pair<K1, ArrayList<Pair<K2, V>>>> result = new ArrayList<Pair<K1, ArrayList<Pair<K2, V>>>>(this.size());
		for (Entry<K1, HashMap<K2, V>> ent1 : this.entrySet()) {
			K1 k1 = ent1.getKey();
			HashMap<K2, V> map2 = ent1.getValue();
			if (map2 != null) {
				ArrayList<Pair<K2, V>> listOfK2VPairs = new ArrayList<Pair<K2,V>>(map2.size());
				for (Entry<K2, V> ent2 : map2.entrySet()) {
					K2 k2 = ent2.getKey();
					V v = ent2.getValue();
					listOfK2VPairs.add(Pair.make(k2, v));
				}
				result.add(Pair.make(k1, listOfK2VPairs));
			}
		}
		return result;
	}	
}
