/**
 * 
 */
package pandit.codejam;

import java.io.BufferedInputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.Scanner;

/**
 * @author Manu Ram Pandit
 * 
 */
public class DancingWithGooglersUpload {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		FileInputStream fStream = new FileInputStream(
				"input.txt");

		Scanner scanner = new Scanner(new BufferedInputStream(fStream));
		Writer out = new OutputStreamWriter(new FileOutputStream("output.txt"));

		int T = scanner.nextInt();
		int N,S,P,ti;
		int counter = 0;
		for (int count = 1; count <= T; count++) {
			N=scanner.nextInt();
			S = scanner.nextInt();
			counter = 0;
			P = scanner.nextInt();
			for(int i=1;i<=N;i++){
				ti=scanner.nextInt();
				if(ti>=(3*P-2)){
					counter++;
					continue;
				}
				else if(S>0){
					if(P>=2 && ((ti==(3*P-3)) ||(ti==(3*P-4)))) {
					S--;
					counter++;
					continue;
					}
				}
				
			}
			// System.out.println("Case #" + count + ": " + counter);
			out.write("Case #" + count + ": " + counter + "\n");
		}
		fStream.close();
		out.close();

	}

}

package DancingWithTheGooglers;

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintWriter;
import java.util.Collections;
import java.util.Scanner;
import java.util.ArrayList;

public class DancingWithTheGooglers {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner in = new Scanner(new FileInputStream("input.txt"));
		PrintWriter out = new PrintWriter(new FileOutputStream("output.txt"));
		
		int lines = in.nextInt();
		in.nextLine();
		int counter = 0;
		
		for (;counter<lines;counter++) {
			out.write("Case #" + (counter+1) + ": ");
			
			int n = in.nextInt();
			int s = in.nextInt();
			int p = in.nextInt();
			int finalCount = 0;
			ArrayList<Integer> scores = new ArrayList<Integer>();
			for (int i = 0; i<n; i++) {
				scores.add(in.nextInt());
			}
			Collections.sort(scores);
			for (int i: scores) {
				if (i<p)
					continue;
				else if ((((i-2)/3)+2)<p)
					continue;
				else if ((((i-1)/3)+1)>=p)
					finalCount++;
				else if (s>0) {
					s--;
					finalCount++;
				}
			}
			out.write(finalCount + "\n");
		}
		
		in.close();
		out.close();
	}
}
