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 _2012._0.b_dancers;

import java.io.FileReader;
import java.io.FileWriter;
import java.io.LineNumberReader;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Map;


public class DancingWithGooglers
{
	public static int countMaxMinScores (int[] totalScores, int i, int numSurprises, int minDesiredPoints, int cabeSurprise)
	{
		if (i >= totalScores.length) {
			if (numSurprises > cabeSurprise) {
				return cabeSurprise - numSurprises;
			} else {
				return 0;
			}
		}
		
		int newCount = 0;
		
System.out.print (totalScores[i] + " (" + minDesiredPoints + "): ");
		if (((minDesiredPoints * 3) - 0) <= totalScores[i]) {
System.out.println("a");
			newCount = 1;
//			if ((((minDesiredPoints * 3) - 4) > 0) || (totalScores[i] <= 8)) {
			if ((totalScores[i] >= 2) && (totalScores[i] <= 28)) {
				cabeSurprise++;
			}
			
		} else if ((((minDesiredPoints * 3) - 2) <= totalScores[i]) && (minDesiredPoints >= 1)) {
System.out.println("b");
			newCount = 1;
			if ((totalScores[i] >= 2) && (totalScores[i] <= 28)) {
			//if ((((minDesiredPoints * 3) - 4) > 0) || (totalScores[i] <= 8)) {
				cabeSurprise++;
			}
			
		} else if ((((minDesiredPoints * 3) - 4) <= totalScores[i]) && (numSurprises > 0) && (minDesiredPoints >= 2)) {
System.out.println("c");
			newCount = 1;
			numSurprises = numSurprises - 1;
		} else {
			if (totalScores[i] >= 2)  cabeSurprise++;
System.out.println("NO");
		}
		
		return newCount + countMaxMinScores (totalScores, i+1, numSurprises, minDesiredPoints, cabeSurprise);
	}
	
	
	/**
	 * @param args
	 */
	public static void main(String[] args)
			throws Exception
	{
		long t0 = System.currentTimeMillis();
		String sIn = "src/_2012/_0/b_dancers/B-large.in";
		if (args.length > 0)  sIn = args[0];
		String sOut = sIn;
		if (sOut.endsWith (".in")) sOut = sOut.substring (0, sOut.length() - 3);
		sOut = sOut + ".out";
		
		LineNumberReader in = new LineNumberReader (new FileReader (sIn));
		PrintWriter out = new PrintWriter (new FileWriter (sOut));
	
		String linea0 = in.readLine();
		int numCasos = Integer.parseInt (linea0);
		
		for (int i=0; i<numCasos; i++) {
			System.out.println ("Case #" + (i+1));
			String s = in.readLine();
			
			String[] trozos = s.split (" ");
			int numDancers = Integer.parseInt(trozos[0]);
			int maxSurprising = Integer.parseInt(trozos[1]);
			int minDesiredPoints = Integer.parseInt(trozos[2]);
			
			int[] totalScores = new int[numDancers];
			for (int j=0; j<numDancers; j++) {
				totalScores[j] = Integer.parseInt(trozos[3 + j]);
			}
			
			int res = countMaxMinScores (totalScores, 0, maxSurprising, minDesiredPoints, 0);
			
			out.println ("Case #" + (i+1) + ": " + res);
		}
		
		
		out.close();
		
		long t1 = System.currentTimeMillis();
		long seg = ((t1 - t0) / 1000);
		double mins = seg / 60d;
		
		System.out.println ("OK - " + mins + " minutos");
	}


}
