/**
 * 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 com.codejam.qualification.b;

import java.io.File;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

import org.apache.commons.io.FileUtils;

public class DancingWithGooglers {
	private Map<String, String> language = new HashMap<String, String>();
	
	public void main() throws IOException {
		List<String> inputLines = FileUtils.readLines(new File("B-small-attempt0.in"));
		
		int numberOfCases = Integer.parseInt(inputLines.get(0));
		List<String> outputLines = new ArrayList<String>();
		
		for (int idx = 1; idx < numberOfCases + 1; idx++) {
			int[] numbers = getNumbersForLine(inputLines, idx);
			int numberOfGooglersDancing = numbers[0];
			int numberOfSuprisingTriplets = numbers[1];
			int resultBetterThan = numbers[2];
			
			int countSimilarScores = 0;
			int countSuprisingScores = 0;
			
			int possibleGoodResult = resultBetterThan * 3 - 2;
			int possibleEdgeResult = resultBetterThan * 3 - 4;
			
			for (int resultIdx = 3; resultIdx < numbers.length; resultIdx++) {
				int result = numbers[resultIdx];
			
				if (result < resultBetterThan)
					continue;
				
				if (result >= possibleGoodResult) {
					countSimilarScores++;
				} else if (result >= possibleEdgeResult) {
					countSuprisingScores++;					
				}
			}
			
			int maximumResultsAbove = countSimilarScores;
			
			if (countSuprisingScores >  numberOfSuprisingTriplets) {
				countSuprisingScores = numberOfSuprisingTriplets;
			}
			
			maximumResultsAbove += countSuprisingScores;
			
			outputLines.add("Case #" + idx + ": " + maximumResultsAbove);
		}
		
		FileUtils.writeLines(new File("out.txt"), outputLines);
	}

	private int[] getNumbersForLine(List<String> outputLines, int idx) {
		String rawNumbers[] = outputLines.get(idx).split(" ");
		int numbers[] = new int[rawNumbers.length];
		
		for (int javaSux = 0; javaSux < rawNumbers.length; javaSux++) {
			numbers[javaSux] = Integer.parseInt(rawNumbers[javaSux]);
		}
		
		return numbers;
	}
		
}
