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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.Iterator;
import java.util.List;

public class Dancing {
	List<Integer> ss = new ArrayList<>();
	int n;
	int min;
	int sp;
	int cnt = 0;
	
	public Dancing(int min, int sp, int[] sc) {
		this.min = min;
		this.n = sc.length;
		this.sp = sp;
		for(int s : sc) {
			ss.add(s);
		}
	}

	public static void main(String[] args) throws IOException {
//		System.out.println(new Dancing(5, 1, new int[] {15, 13, 11}).solve());
//		System.out.println(new Dancing(8, 0, new int[] {23, 22, 21}).solve());
//		System.out.println(new Dancing(1, 1, new int[] {8, 0}).solve());
//		System.out.println(new Dancing(8, 2, new int[] {29, 20, 8, 18, 18, 21}).solve());
		
		BufferedReader br = new BufferedReader(new FileReader("src/b/B-large.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter("src/b/out"));
		
		int row = Integer.parseInt(br.readLine());
		System.out.println("ROW : " + row);
		
		for(int i=0; i<row; i++) {
			String[] line = br.readLine().split(" ");
			int n = Integer.parseInt(line[0]);
			int sp = Integer.parseInt(line[1]);
			int min = Integer.parseInt(line[2]);
			int[] sc = new int[n];
			for(int j=0; j<n; j++) {
				sc[j] = Integer.parseInt(line[3+j]);
			}
			
			String res = "Case #" + (i+1) + ": " + new Dancing(min, sp, sc).solve();
			bw.write(res + "\n");
			System.out.println(res);
		}
		
		bw.close();
		br.close();
	}

	private int solve() {
		for(Iterator<Integer> it = ss.iterator(); it.hasNext();) { 
			int s = it.next();
			int rest = s - min;
			if (rest < 0) continue;
			if (rest /2 >= Math.max(min-1,0)) {
				cnt++;
				it.remove();
			}
		}
		
		Collections.sort(ss, new Comparator<Integer>() {
			public int compare(Integer o1, Integer o2) {
				return o2- o1;
			}
		});
		
		for(Iterator<Integer> it = ss.iterator(); it.hasNext();) {
			int s = it.next();
			int rest = s - min;
			if (rest < 0) continue;
			if (rest / 2 >=  Math.max(min-2, 0) && sp > 0) {
				cnt++;
				sp--;
				it.remove();
			}
		}
		
		return cnt;
	}
}
