import java.util.List;


public class Case implements Runnable {

	private int id;
	private String output;

	private int n;
	private int s;
	private int p;
	private List<Integer> g;

	public Case(int id) {
		this.id = id;
	}

	public Case(int id, int n, int s, int p, List<Integer> g) {
		super();
		this.id = id;
		this.n = n;
		this.s = s;
		this.p = p;
		this.g = g;
	}

	public String solve() {
		int res = 0;
		for (int googler : g) {
			int b = googler / 3;
			boolean div = googler % 3 == 0;
			if (b >= p) {
				res++;
				continue;
			}
			if (p == b+1) {
				if (div && s > 0 && b > 0) {
					res++;
					s--;
					continue;
				}
				if (!div) {
					res++;
					continue;
				}
			}
			if (p == b+2) {
				if (3*b+2 == googler && s > 0) {
					res++;
					s--;
				}
			}
		}
		return String.valueOf(res);
	}

	@Override
	public void run() {
		output = solve();
	}

	@Override
	public String toString() {
		return "Case #" + id + ": " + output;
	}

}
package practice.GC2012;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Dancers {
	
	public static void main(String args[]) throws IOException {
		Scanner s = new Scanner(new File("Z:\\junkyard\\practice\\resources\\input2.txt"));
		FileWriter fo = new FileWriter(new File("Z:\\junkyard\\practice\\resources\\output2.txt"));
		int num = s.nextInt();
		for(int i = 1; i<= num; i++) {
			fo.write("Case #" + i + ": ");
			int nd = s.nextInt();
			int ns = s.nextInt();
			System.out.println("\n"+ i + " - " + nd + " , "+ ns);

			int p = s.nextInt();
			int alreadyhigh = Math.max(p, 0) + Math.max(p-1, 0) + Math.max(p-1, 0);
			int surpriseScore = Math.max(p, 0) + Math.max(p-2, 0) + Math.max(p-2, 0);
			int bestScorers = 0;
			int canSurprise = 0;
			for(int j = 1; j<=nd; j++) {
				int score = s.nextInt();
				System.out.print(score + " - ");
				if (score == 0) {
					continue;
				}
				if (score >= alreadyhigh) {
					bestScorers ++;
				} else if(score >= surpriseScore) {
					canSurprise ++;
				}
			}
			if (canSurprise < ns) {
				bestScorers += canSurprise;
			} else {
				bestScorers += ns;
			}
			if(p==0) {
				fo.write(nd + "\n");
			} else {
				fo.write(bestScorers + "\n");
			}
		}
			fo.close();
			s.close();
	}
}
