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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;

public class Dancers {

	/**
	 * @param args
	 * @Testcases
	 */
	// Idea:
	// Greater than or equal to >= 3*P - 2 then will pass the boundary of P.
	// else if it was less than but greater than or equal to 3*P - 4 and S is
	// still > 0 in this case consume a surprising ticket.
	// else less than that Cannot.
	private int calculateMax(int S, int P, int[] scores) {
		int minP = Math.max(0, 3 * P - 4);
		int maxP = Math.max(0, 3 * P - 2);
		int maxNumWinners = 0;
		for (int i = 0; i < scores.length; i++) {
			int score = scores[i];
			if (score >= P) {
				if (scores[i] >= maxP) {
					maxNumWinners++;
				} else if (scores[i] >= minP && S > 0) {
					maxNumWinners++;
					S--;
				}
			}
		}
		return maxNumWinners;
	}

	public int performe(String[] in) {
		int N = Integer.parseInt(in[0]);
		int S = Integer.parseInt(in[1]);
		int P = Integer.parseInt(in[2]);
		int[] scores = new int[N];
		for (int i = 0; i < N; i++) {
			scores[i] = Integer.parseInt(in[i + 3]);
		}
		return calculateMax(S, P, scores);
	}

	// Input
	// 4
	// 3 1 5 15 13 11
	// 3 0 8 23 22 21
	// 2 1 1 8 0
	// 6 2 8 29 20 8 18 18 21
	//
	// Output
	// Case #1: 3
	// Case #2: 2
	// Case #3: 1
	// Case #4: 3
	public static void main(String[] args) {

		Dancers dancers = new Dancers();

		try {
			FileInputStream fstream = new FileInputStream("B-small-attempt0.in");
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));

			FileWriter fwriter = new FileWriter("B-small-attempt0.out");
			BufferedWriter out = new BufferedWriter(fwriter);

			String strLine;
			strLine = br.readLine();
			int testCases = Integer.parseInt(strLine);

			int currentCase = 0;
			while ((strLine = br.readLine()) != null && currentCase < testCases) {
				out.write("Case #" + ++currentCase + ": "
						+ dancers.performe(strLine.split(" ")));
				out.newLine();
			}
			in.close();
			out.close();
		} catch (Exception e) {
			System.err.println("I/O Error while reading file.");
		}

	}

}
