import java.util.*;
import java.io.*;

public class DancingWithTheGooglers
{
    public DancingWithTheGooglers()
    {
        Scanner inFile = null;
        try
        {
            inFile = new Scanner(new File("inputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening input file. Exiting...");
			System.exit(0);
        }
        int t = inFile.nextInt();
        
        int [] results = new int [t];
        DancingWithTheGooglersMax [] rnc = new DancingWithTheGooglersMax[t];
        
        int i, j;
        int [] scores;
        int s, p;
        for(i = 0; i < t; i++)
        {
            scores = new int [inFile.nextInt()];
            s = inFile.nextInt();
            p = inFile.nextInt();
            for(j = 0; j < scores.length; j++)
                scores[j] = inFile.nextInt();
            
            rnc[i] = new DancingWithTheGooglersMax(i, scores, s, p, results);
            rnc[i].start();
        }
        inFile.close();
        
        boolean done = false;
        
        while(!done)
        {
            done = true;
            for(i = 0; i < t; i++)
                if(rnc[i].isAlive())
                {
                    done = false;
                    break;
                }
        }
        
        PrintWriter outFile = null;
        try
        {
            outFile = new PrintWriter(new File("outputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening output file. Exiting...");
			System.exit(0);
        }
        
        for(i = 0; i < results.length; i++)
            outFile.printf("Case #%d: %d\n", i+1, results[i]);
        outFile.close();
    }
    
    public static void main(String [] args)
    {
        new DancingWithTheGooglers();
    }
    
    private class DancingWithTheGooglersMax extends Thread
    {
        int id;
        int s, p;
        int [] results, scores;
        
        public DancingWithTheGooglersMax(int i, int [] aScores, int aS, int aP,int [] res)
        {
            id = i;
            s = aS;
            p = aP;
            results = res;
            scores = aScores;
        }
        
        public void run()
        {
            int a = 0, b = 0;
            
            if(p == 0)
                results[id] = scores.length;
            else if(p == 1)
            {
                int y;
                y = 3*p - 3;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > 0)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
            else
            {
                int y, z;
                y = 3*p - 3;
                z = 3*p - 5;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > z)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
        }
    }
}
package com.googlecode.codejam.model;

import java.io.BufferedWriter;
import java.io.File;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.Future;

import org.apache.commons.io.FileUtils;
import org.apache.commons.io.IOUtils;

public class JamResolver {

	private final JamCaseResolverFactory jamCaseResolverFactory;
	
	private final File input;
	
	private final File output;

	public JamResolver(JamCaseResolverFactory jamCaseResolverFactory, String parentDirectory, String fileName) {
		this.jamCaseResolverFactory = jamCaseResolverFactory;
		if(!new File(parentDirectory).exists())
			parentDirectory = Constants.PARENT_DIRECTORY + parentDirectory;
		this.input = new File(parentDirectory, fileName);
		this.output = new File(parentDirectory, fileName.replaceFirst("\\.in$", ".out"));
	}
	
	public void resolve() throws Exception {
		System.out.println("Started computation, resolver: " + jamCaseResolverFactory.getClass().getPackage().getName());
		System.out.println("Input\tFile: " + input.getAbsolutePath());
		System.out.println("Output\tFile: " + output.getAbsolutePath());
		final ExecutorService executor = Executors.newFixedThreadPool(1);
		try {
			final Iterator<String> lineIterator = FileUtils.lineIterator(input, "UTF-8");
			final int caseNumber = Integer.parseInt(lineIterator.next());
			final List<Future<String>> solutions = new ArrayList<Future<String>>(caseNumber);
			for (int i = 1; i <= caseNumber; i++) {
				solutions.add(executor.submit(jamCaseResolverFactory.newJamCaseResolver(i, lineIterator)));
			}
			final BufferedWriter solutionFile = new BufferedWriter(new OutputStreamWriter(FileUtils.openOutputStream(output)));
			int count = 1;
			try {
				for (Future<String> future : solutions) {
					solutionFile.append("Case #").append(String.valueOf(count++)).append(": ");
					solutionFile.append(future.get());
					solutionFile.newLine();
				}
			} finally {
				IOUtils.closeQuietly(solutionFile);
			}
		} finally {
			executor.shutdown();
		}
		System.out.println("Ended computation");
	}
	
}
