import java.io.BufferedWriter;
import java.io.File;
import java.io.FileOutputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Scanner;


public class Dancing_With_the_Googlers {


    /**
     * The first line of the input gives the number of test cases, T.
     *  T test cases follow. 
     *  Each test case consists of a single line containing integers separated by single spaces. 
     *  The first integer will be N, the number of Googlers, and the second integer will be S, the number of surprising triplets of scores. 
     *  The third integer will be p, as described above. Next will be N integers ti: the total points of the Googlers. 
     * @throws IOException
     */
	   public static void main(String[] args) throws IOException {
	        // TODO Auto-generated method stub
			// Reading the input file
			Scanner in = new Scanner(new File("B-large.in"));
			// writting the input file
			FileOutputStream fos = new FileOutputStream("B-large.out");
			PrintStream out = new PrintStream(fos);
	         //Close the output stream
	        int testCase=Integer.parseInt(in.nextLine());
	        for(int i=0;i<testCase;i++) {
	        	out.print("Case #" + (i + 1) + ":\t");
	        	int NoOfGooglers= in.nextInt();
	        	int NoOfSurprisingResults = in.nextInt();
	        	int atLeastP=in.nextInt();
	        	ArrayList<Integer> scores= new ArrayList<Integer>();
        		int BestResults=0;
        		int Surprising=0;
	        	for(int j=0;j<NoOfGooglers;j++)
	        	{
	        		scores.add(in.nextInt());
	        		//System.out.print(scores.get(j));
	        		int modulus=scores.get(j)%3;
	        		int temp = scores.get(j);
	    			switch (modulus) {
					case 0:
						if (((temp / 3) >= atLeastP)) {
							BestResults++;
						} else {
							if (((((temp / 3) + 1) >= atLeastP) && ((temp / 3) >= 1))
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
								
							}
							System.out.println("Case 0"+"itr:"+i+"  surprising:"+temp);
						}
						
						break;
					case 1:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
							continue;
						}
						
						break;
					case 2:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
						} else {
							if (((temp / 3) + 2 >= atLeastP)
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
							}
							System.out.println("Case 2"+"itr:"+i+"  surprising:"+temp);
						}
						break;
					default:
						System.out.println("Error");
					}
	    			
				}// Internal for
				out.println(BestResults);
				// System.out.println(BestResults);
				System.out.println(Surprising);
				BestResults = 0;
			}// for
			in.close();
			out.close();
			fos.close();

	   }
}

package Dancing;

import java.io.*;
import java.util.Arrays;
import java.util.Iterator;
import java.util.List;

/**
 * Created with IntelliJ IDEA.
 * User: kevin
 * Date: 4/13/12
 * Time: 8:00 PM
 * To change this template use File | Settings | File Templates.
 */
public class Dancing {

    public static Iterator<DanceSet> parseSets(String filename) throws IOException {
        File file = new File(filename);
        final BufferedReader reader = new BufferedReader(new FileReader(filename));
        reader.readLine();
        //ehhh unclosed reader =P

        Iterator<DanceSet> itr = new Iterator<DanceSet>() {

            String line=null;
            @Override
            public boolean hasNext() {
                try{

                    line=reader.readLine();
                }   catch (Exception e){
                    throw new RuntimeException(e);
                }
                return line!=null;  //To change body of implemented methods use File | Settings | File Templates.
            }

            @Override
            public DanceSet next() {
                if(line==null)
                    return null;
                String[] split = line.split("\\s");

                int[] numbers = new int[split.length];
                for(int i =0;i<split.length;++i){
                    numbers[i]=Integer.parseInt(split[i]);
                }

                DanceSet set = new DanceSet(numbers[0],numbers[1],numbers[2], Arrays.copyOfRange(numbers,3,numbers.length));

                return set;

            }


            @Override
            public void remove() {
                //To change body of implemented methods use File | Settings | File Templates.
            }
        };
        return itr;

    }

    public static int findMinimumWithLowScore(DanceSet set) {

        int used = 0;
        int answer = 0;
        boolean hasSuprisesLeft = used < set.sunrises;
        int smin = (set.minscore - 2) * 3;
        int min = (set.minscore - 1) * 3;

        if(set.minscore==0)
            return set.dancers;
        for (int score : set.scores) {

            if (score <= smin || score == 0)
                continue;
            if (score > smin && score <= min)
                if (!hasSuprisesLeft) {
                    continue;
                } else {
                    ++used;
                    hasSuprisesLeft = used < set.sunrises;
                }
            ++answer;

        }

        return answer;
    }

    public static void main(String[] argv) throws IOException {
        FileWriter output = new FileWriter("output.dance.txt");
        BufferedWriter writer = new BufferedWriter(output);
        Iterator<DanceSet> itr = parseSets(argv[0]);

        int cnum = 1;
        while(itr.hasNext()){
            int ans= findMinimumWithLowScore(itr.next());
            output.write(String.format("Case #%d: %d\n",cnum++,ans));

        }
        output.close();

    }

}
