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


public class BestResult 
{
	public int result(String input)throws Exception
	{
		String[] array= input.split(" ");
		int noOfGooglers = Integer.parseInt(array[0]);
		int surprising = Integer.parseInt(array[1]);
		int p = Integer.parseInt(array[2]);
		int x;
		int[] listOfBestResults = new int[noOfGooglers];
		int count = 0;
		for(int i=3;i<array.length;i++)
		{
			x = Integer.parseInt(array[i]);
			if(canItBeBestResult(x, p))
			{
				listOfBestResults[count] = x;
				count++;
			}
		}
		int bestResultCount = 0;
		for(int i=0;i<count;i++)
		{
			if(listOfBestResults[i]%3 == 2)
			{
				if(listOfBestResults[i]/3>=p)
				{
					System.out.println("list of best result w/o surprising " + listOfBestResults[i]);
					bestResultCount++;
				}
				
				else if((listOfBestResults[i]/3) + 2>=p && (listOfBestResults[i]/3) + 1>=p)
				{
					System.out.println("list of best result w/o surprising " + listOfBestResults[i]);
					bestResultCount++;
				}
				else if((listOfBestResults[i]/3) + 2>=p && surprising!=0)
				{
					System.out.println("list of best result surprising " + listOfBestResults[i]);
					bestResultCount++;
					surprising--;
				}
			}
			else if(listOfBestResults[i]%3 == 1 )
			{
				if(listOfBestResults[i]/3>=p)
				{
					System.out.println("list of best result w/o surprising " + listOfBestResults[i]);
					bestResultCount++;
				}
				else if((listOfBestResults[i]/3) + 1>=p)
				{
					System.out.println("list of best result w/o surprising " + listOfBestResults[i]);
					bestResultCount++;
				}
				else if((listOfBestResults[i]/3) + 1>=p && surprising!=0)
				{
					System.out.println("list of best result surprising " + listOfBestResults[i]);
					bestResultCount++;
					surprising--;
				}
			}
			else if( listOfBestResults[i]%3 == 0 )
			{
				if(listOfBestResults[i]/3>=p)
				{
					System.out.println("list of best result w/o surprising " + listOfBestResults[i]);
					bestResultCount++;
				}
				
				else if((listOfBestResults[i]/3) + 1>=p && surprising!=0)
				{
					System.out.println("list of best result surprising " + listOfBestResults[i]);
					bestResultCount++;
					surprising--;
				}
			}
			
		}
		return bestResultCount;
		
	}
	public boolean canItBeBestResult(int x, int p)
	{
		if(p==0)
		{
			return true;
		}
		if( x%3 == 2 && ((x/3)+2) >= p)
		{
			return true;
		}
		else if( x%3 == 1 && ((x/3)+1) >= p)
		{
			return true;
		}
		else if( x%3 == 0 && ((x/3)+1)>=p && x!=0)
		{
			return true;
		}
		
		return false;
	}
}
