/**
 * Created by IntelliJ IDEA.
 * User: Administrator
 * Date: 3/3/12
 * Time: 11:00 AM
 * To change this template use File | Settings | File Templates.
 */

import SRMLib.MathLibrary;
import SRMLib.TestSRMLib;
import com.sun.org.apache.bcel.internal.generic.F2D;

import java.io.*;
import java.util.*;
import java.util.zip.Inflater;

public class SRM {
    public static void main(String[] args) throws IOException {
        //TestSRMLib.run();
        codeJam1.main();

        return;
    }
}
class codeJam1 {
    public static void main() throws IOException {
        String inputPath = "E:\\input.txt";
        String outputPath = "E:\\output.txt";
        BufferedReader input = new BufferedReader(new FileReader(inputPath));
        BufferedWriter output = new BufferedWriter(new FileWriter(outputPath));

        String line;
        line = input.readLine();
        int T = Integer.parseInt(line);
        for (int i = 1; i <= T; ++i) {
            line = input.readLine();
            String[] words = line.split(" ");
            int N = Integer.parseInt(words[0]);
            int S = Integer.parseInt(words[1]);
            int p = Integer.parseInt(words[2]);
            int n = 0;
            int res = 0;

            for (int j = 3; j < words.length; ++j) {
                if (p == 0) {
                    res++;
                    continue;
                }

                int t = Integer.parseInt(words[j]);
                if (p == 1) {
                    if (t > 0)
                        res++;
                    continue;
                }
                if (t >= 3 * p - 2)
                    res++;
                else if (t >= 3 * p - 4)
                    n++;
            }

            res += Math.min(n, S);
            output.write("Case #" + i + ": " + res);
            output.newLine();
        }

        input.close();
        output.close();
    }
}

package dancingwiththegooglers;

import java.util.ArrayList;
import java.util.List;

public class TestCase {
	int numberOfGooglers;
	public int getNumberOfGooglers() {
		return numberOfGooglers;
	}
	public int getSurprisingScores() {
		return surprisingScores;
	}
	public int getBestResult() {
		return bestResult;
	}
	int surprisingScores;
	int bestResult;
	
	List<Integer> scores = null;
	
	public TestCase(int numberOfGooglers, int surprisingScores, int bestResult, List<Integer> scores){
		this.numberOfGooglers = numberOfGooglers;
		this.surprisingScores = surprisingScores;
		this.bestResult = bestResult;
		this.scores = new ArrayList<Integer>(scores);		
	}
	
	public int execute(){
		int bestScorers = 0;
		for(int score : this.scores){
			if(canItBeTheBestScorer(score, bestResult))
				bestScorers++;			
		}
		return bestScorers;
	}
	private boolean canItBeTheBestScorer(int score, int bestResult2) {
		if(score < bestResult2)
			return false;
		if(bestResult2 == 0)
			return true;
		if(bestResult2 == 1)
			if(score > 0)
				return true;
			else
				return false;
		if(score >= (bestResult2 * 3) - 2){
			return true;
		}else if(score >= (bestResult2 * 3) - 4){
			if(this.surprisingScores > 0){
				this.surprisingScores--;
				return true;
			}
			return false;
		}
		return false;
	}
	
}
