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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;

public class ProblemBDancingGooglers {

	public ProblemBDancingGooglers() {
		try {
			FileReader fr = new FileReader("B-large.in");
			BufferedReader br = new BufferedReader(fr);
			
			FileWriter fw = new FileWriter("B-large.out");
			BufferedWriter bw = new BufferedWriter(fw);
			
			int numCases = Integer.parseInt(br.readLine());
			int caseNum = 1;
			
			String line = br.readLine();
			while (line != null) {
				System.out.println(line);
				int numGooglers = getNumGooglersFromLine(line);
				int numSurprises = getNumSurprisesFromLine(line);
				int bestScore = getBestScoreFromLine(line);
				int[] scores = getScoresFromLine(line, numGooglers);
				
				int possibles = 0;
				for (int i=0; i<scores.length; i++) {
					int withSurprise = bestScoreWithSurprise(scores[i]);
					int withoutSurprise = bestScoreNoSurprise(scores[i]);
					
					if (withoutSurprise >= bestScore) {
						possibles++;
					} else if (withSurprise >= bestScore && numSurprises > 0) {
						possibles++;
						numSurprises--;
					}
				}
				
				String output = "Case #"+ caseNum;
				output += ": "+possibles;
				
				System.out.println(output);
				bw.append(output);
				if (caseNum != numCases)
					bw.newLine();
				
				caseNum++;
				line = br.readLine();
			}
			
			bw.flush();
			bw.close();
			br.close();
			
		} catch(Exception e) {
			e.printStackTrace();
		}
	}
	
	public int[] getScoresFromLine(String line, int numScores) {
		int[] scores = new int[numScores];

		int firstSpace = line.indexOf(" ");
		int secondSpace = line.indexOf(" ",firstSpace + 1);
		int thirdSpace = line.indexOf(" ",secondSpace + 1);
		
		line = line.substring(thirdSpace + 1);
		
		String[] scoreStrings = line.split(" ");
		for (int i=0; i<scoreStrings.length; i++) {
			scores[i] = Integer.parseInt(scoreStrings[i]);
		}
		
		return scores;
	}
	
	public int getNumGooglersFromLine(String line) {
		String[] split = line.split(" ");
		return Integer.parseInt(split[0]);
	}
	
	public int getNumSurprisesFromLine(String line) {
		String[] split = line.split(" ");
		return Integer.parseInt(split[1]);
	}
	
	public int getBestScoreFromLine(String line) {
		String[] split = line.split(" ");
		return Integer.parseInt(split[2]);
	}
	
	/**
	 * 
	 * @param totalScore
	 * @return the best possible score without a surprise
	 */
	public int bestScoreNoSurprise(int totalScore) {
		return Math.min(totalScore, (totalScore + 2) / 3);
	}
	
	/**
	 * 
	 * @param totalScore
	 * @return the best possible score with a surprise
	 */
	public int bestScoreWithSurprise(int totalScore) {
		return Math.min(totalScore,Math.min((totalScore + 4) / 3,10));
	}
	
	public static void main(String[] args) {
		new ProblemBDancingGooglers();
	}

}
