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 com.jam.google;

public class DancingWithTheGooglers {

  public int count(int n, int s, int p, String ts) {
    int count = 0;
    String[] split = ts.split(" ");
    for (String st : split) {
      int t = Integer.parseInt(st);
      int base = t / 3;
      if (base < p-2) continue;
      if (base>=p || 
          (base>= p-1 && t > 3*base) ||
          (base>= p-1 && (t > 3*base || (base > 0 && s-- >0))) ||
          (base>= p-2 && t-1 > 3*base && s-- >0) )
      count++;
    }
    return count;
  }
  
}
