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.Qualification_2012;

import java.io.FileNotFoundException;
import java.io.FileReader;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class DancingWithGooglers {
	private static int S = 0;
	public static void main(String[] args) {
		try {			
			Scanner sc = new Scanner(new FileReader("D:/Nandan/Project/GoogleCodeJam/Qualification-2012/B-small.in"));
			int T = sc.nextInt();
			for(int t=1; t<=T; t++){
				int N = sc.nextInt();
				S = sc.nextInt();
				int p = sc.nextInt();
				int count = 0;
				for(int i=0; i<N; i++){
					int googlerScore = sc.nextInt();
					if(hasMatches(googlerScore, p)){
						count++;
					}
				}
				System.out.println("Case #"+t+": "+ count);
			}
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}

	private static boolean hasMatches(int googlerScore, int p) {
		int actualScore = googlerScore;
		int a = googlerScore/3;
		int remainder = googlerScore%3;
		googlerScore = googlerScore-a;
		int b = googlerScore/2;
		int secondRemainder = googlerScore%2;
		int c = googlerScore - b;
		
		if(remainder == 0 && Math.abs(p-a) == 2 && S > 0 && actualScore > 2){
			S--;
			return true;
		}
		
		if(secondRemainder == 0 && Math.abs(p-b) == 1 && S > 0 && actualScore > 2){
			S--;
			return true;
		}
		
		if((a >= p) || (b >= p) || (c >= p)){
			return true;
		}
		return false;
	}
}
