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.lsworks.google.codejam.qualification2012;

import java.io.File;
import java.io.IOException;
import java.util.List;

import com.google.common.base.Charsets;
import com.google.common.io.Files;

public class GooglersDance {

	public static void main(String[] args) throws IOException {
		GooglersDance text2googleresse = new GooglersDance();
		text2googleresse.t2g();
	}

	private void t2g() throws IOException {
		// File inputFile = new File(
		// "src/main/resources/qualification2012/B-sample.in");
//		File inputFile = new File(
//				"src/main/resources/qualification2012/B-small-attempt3.in");
		 File inputFile = new File(
		 "src/main/resources/qualification2012/B-large.in");
		List<String> inputs = Files.readLines(inputFile, Charsets.UTF_8);
		int totalTest = Integer.parseInt(inputs.remove(0));

		for (int test = 1; test <= totalTest; test++) {
			String[] inStr = inputs.remove(0).split(" ");
			int S = Integer.parseInt(inStr[1]);
			int p = Integer.parseInt(inStr[2]);

			int nm = 0;
			int sm = 0;
			
			if (p == 0) {
				nm = 0;
				sm = 0;
			} else if (p == 1) {
				nm = 1;
				sm = 1;
			} else if (p == 2) {
				nm = 4;
				sm = 2;
			} else {
				nm = 3 * (p - 1) + 1;
				sm = 3 * (p - 2) + 2;
			}

			int output = 0;
			for (int i = 3; i < inStr.length; i++) {
				int t = Integer.parseInt(inStr[i]);

				if (t >= nm) {
					output++;
				} else if (t >= sm && S > 0) {
					output++;
					S--;
				}
			}
			System.out.format("Case #%d: %s\n", test, output);
		}
	}
}
