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.kingter;

import java.io.FileReader;
import java.io.LineNumberReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;

public class GoogleDancer {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws Exception {
		//read
		List<Integer> resultList = new ArrayList<Integer>();
		
//		LineNumberReader lin = new LineNumberReader(new FileReader("./B-small-attempt0.in"));
		LineNumberReader lin = new LineNumberReader(new FileReader("./B-large.in"));
		
		String line = null;
		while ((line = lin.readLine()) != null) {
			System.out.println("Process #"+lin.getLineNumber()+":"+line);
			if (lin.getLineNumber() == 1) continue;
			String[] testCaseStr = line.split(" ");
			int N = Integer.parseInt(testCaseStr[0]);
			int S = Integer.parseInt(testCaseStr[1]);
			int p = Integer.parseInt(testCaseStr[2]);
			
			List<Integer> tl = new ArrayList<Integer>(testCaseStr.length - 3);
			for (int i = 3; i < testCaseStr.length; i++) {
				tl.add(Integer.parseInt(testCaseStr[i]));
			}
			resultList.add(count(N, S, p, tl));
			
		}
		
		//write
		
//		 PrintWriter out = new PrintWriter("./B-small-attempt0.out");
		 PrintWriter out = new PrintWriter("./B-large.out");
		try{
			int i = 1;
			for (Iterator<Integer> it = resultList.iterator(); it.hasNext();) {
				int count = it.next();
				System.out.println("Case #"+i+": "+count);
				out.println("Case #"+i+": "+count);
				i++;
			}
		} finally {
			out.close();
		}

	}
	public static int count(int N, int S, int p, List<Integer> tl) {
		System.out.print("N="+N+",");
		System.out.print("S="+S+",");
		System.out.println("p="+p+",");
		System.out.println("tl="+tl);
		
		//count
		int count = 0;
		int best = Math.max(S, (p * 3) - 2);
		int supBest = Math.max(S, best -2);
		
		for (Iterator<Integer> it = tl.iterator(); it.hasNext();) {
			int result = it.next();
			if (result >= best) {
				count++;
				continue;
			}
			if (result >= supBest && S >= 1) {
				count++;
				S--;
			}
		}
		System.out.println("count="+count);
		
		return count;
	}

}
