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 se.round1.problem2;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.util.HashMap;
import java.util.Map;

import se.round1.util.JamUtil;

public class Problem2 {

	Map<Character, Character> trans = new HashMap<Character, Character>();
	
	public static void main(String[] args) throws IOException{
		new Problem2();
	}
	
	public Problem2() throws IOException{
		
		BufferedReader reader = JamUtil.getReader("problem2/B-large.in");
		
		int currCase = 0;
		String s = "";
		boolean first = true;
		BufferedWriter writer = JamUtil.getWriter("problem2/output.txt");
		while((s = reader.readLine()) != null){
			if(first){
				s = reader.readLine();
				first = false;
			}
			currCase++;
			int res = solveLine(s);
			String sol = "Case #"+currCase+": "+res+"\n";
			System.out.print(sol);
	
			writer.write(sol);
		}
		writer.close();
	}
	
	
	private int solveLine(String line){
		String[] linearr = line.split(" ");
		int dancers = Integer.parseInt(linearr[0]);
		int surprice = Integer.parseInt(linearr[1]);
		int scoreToReach = Integer.parseInt(linearr[2]);
		int success = 0;
		for(int i=0;i<dancers;++i){
			int score = Integer.parseInt(linearr[3+i]);
			int maxScore = canReachScoreWithoutSurprice(score);
			
			if(maxScore >= scoreToReach){
				success++;
			}
			else if( surprice > 0 && (maxScore+1) >= scoreToReach && score >= 2 && ( (3*maxScore) -1) <= score){
				success++;
				surprice--;
			}
		}
		
		return success;
	}
	
	private int canReachScoreWithoutSurprice(int score){
		if(score == 0)
			return 0;
		if(score == 1)
			return 1;
		if(score == 2)
			return 1;
		if(score == 3)
			return 1;
		
		int test = score / 3;
		
		while( 3*(test)+1 > score){
			test--;
		}

		if(test <=0)
			return 0;
		return test+1;
	}
	

	
}
