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 jam;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.StringTokenizer;

public class CodeJam2012Q2 {
	public static void main(String [] args){
		final String FILE_NAME="B-large.in";
		StringTokenizer st;
		
		//IOUsage Variables
		String lineIn="";
		int numCases=0;
		
		//Index Variables
		
		//Contest Vars
		int numGooglers = 0;
		int numSurprising = 0;
		int atLeastResult = 0;
		int[] googlerScores;
		
		int numGP = 0;
		
		try
		{
			BufferedReader br = new BufferedReader(new FileReader(FILE_NAME));
			lineIn = br.readLine();
			numCases = Integer.parseInt(lineIn);
			for(int i=0; i<numCases; i++)
			{
				lineIn = br.readLine();
				st = new StringTokenizer(lineIn);
				numGooglers = Integer.parseInt(st.nextToken());
				numSurprising = Integer.parseInt(st.nextToken());
				atLeastResult = Integer.parseInt(st.nextToken());
				googlerScores = new int[numGooglers];
				
				for(int j=0; j<numGooglers; j++)
				{
					googlerScores[j] = Integer.parseInt(st.nextToken());
				}
				
				for(int j=0; j<numGooglers; j++)
				{
					if(googlerScores[j]==0)
					{
						if(atLeastResult==0)
						{
							numGP++;
						}
					}
					else if(googlerScores[j]==1)
					{
						if(atLeastResult==0 || atLeastResult==1)
						{
							numGP++;
						}
					}
					else if(googlerScores[j]==2)
					{
						if(atLeastResult==0 || atLeastResult==1)
						{
							numGP++;
						}
						else if(atLeastResult==2)
						{
							if(numSurprising>0)
							{
								numGP++;
								numSurprising--;
							}
						}
					}
					else
					{
						if((googlerScores[j] % 3) == 0)
						{
							if((googlerScores[j]/3) - atLeastResult > -1 )
							{
								numGP++;
							}
							else if((((googlerScores[j]/3) - atLeastResult) == -1) && numSurprising>0)
							{
								numGP++;
								numSurprising--;
							}
						}
						else if((googlerScores[j] % 3) == 1)
						{
							if (((googlerScores[j]/3)+1) - atLeastResult >= 0)
							{
								numGP++;
							}
						}
						else if((googlerScores[j] % 3) == 2)
						{
							if((googlerScores[j]/3) - atLeastResult + 1 > -1 )
							{
								numGP++;
							}
							else if((((googlerScores[j]/3) - atLeastResult + 1) == -1) && numSurprising>0)
							{
								numGP++;
								numSurprising--;
							}
						}
					}
				}
				System.out.println("Case #"+(i+1)+": "+numGP);
				
				numGP=0;
			}
		}
		catch(IOException ioe)
		{
			ioe.printStackTrace();
		}
		
		
	}
}
