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

import java.io.File;
import java.io.PrintWriter;
import java.util.Scanner;

public class QR2 {
	
	public static void main(String[] args) throws Exception {
		Scanner inputFile=new Scanner(new File(args[0]));
		PrintWriter outputFile=new PrintWriter(new File(args[1]));
			
		int t=Integer.parseInt(inputFile.nextLine());	
		for(int i=0;i<t;i++){
			int result = 0;
			
			String[] aCase = inputFile.nextLine().split(" ");
			
			int numGooglers = Integer.parseInt(aCase[0]);
			int numSurprising = Integer.parseInt(aCase[1]);
			int p = Integer.parseInt(aCase[2]);
			int[][] scoreboard = new int[numGooglers][5];
			
			for(int j=0; j<numGooglers; j++) {
				scoreboard[j][0] = Integer.parseInt(aCase[3+j]);
			}
			
			for(int j=0; j<numGooglers;j++) {
				int avg = scoreboard[j][0]/3;
				int mod = scoreboard[j][0]%3;
				
				scoreboard[j][1] = mod;
				switch(mod) {
				case 0:
					scoreboard[j][2] = avg; scoreboard[j][3] = avg; scoreboard[j][4] = avg;
					break;
				case 1:
					scoreboard[j][2] = avg+1; scoreboard[j][3] = avg; scoreboard[j][4] = avg;
					break;
				case 2:
					scoreboard[j][2] = avg+1; scoreboard[j][3] = avg+1; scoreboard[j][4] = avg;
					break;
				}
			}
			
			for(int j=0; j<numGooglers;j++) {
				if(scoreboard[j][2] >= p) {
					result = result + 1;
				} else if( scoreboard[j][2] == p-1	//diff with 1 score
						&& numSurprising > 0		//still has suprise quota
						&& scoreboard[j][1] != 1	//suprise-able?
						&& (scoreboard[j][0] >= 3 && scoreboard[j][0] <= 27) //suprise-able?
						) {
					result = result + 1;
					numSurprising = numSurprising - 1;
				}
			}
			
			outputFile.println("Case #"+(i+1)+": " + result);
			System.out.println("Case #"+(i+1)+": " + result);
		}

		inputFile.close();
		outputFile.close();
	}
	
}
