import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

package com.kingter;

import java.io.FileReader;
import java.io.LineNumberReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;

public class GoogleDancer {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws Exception {
		//read
		List<Integer> resultList = new ArrayList<Integer>();
		
		LineNumberReader lin = new LineNumberReader(new FileReader("./B-small-attempt0.in"));
		
		String line = null;
		while ((line = lin.readLine()) != null) {
			System.out.println("Process #"+lin.getLineNumber()+":"+line);
			if (lin.getLineNumber() == 1) continue;
			String[] testCaseStr = line.split(" ");
			int N = Integer.parseInt(testCaseStr[0]);
			int S = Integer.parseInt(testCaseStr[1]);
			int p = Integer.parseInt(testCaseStr[2]);
			
			List<Integer> tl = new ArrayList<Integer>(testCaseStr.length - 3);
			for (int i = 3; i < testCaseStr.length; i++) {
				tl.add(Integer.parseInt(testCaseStr[i]));
			}
			resultList.add(count(N, S, p, tl));
			
		}
		
		//write
		
		 PrintWriter out = new PrintWriter("./B-small-attempt0.out");
		try{
			int i = 1;
			for (Iterator<Integer> it = resultList.iterator(); it.hasNext();) {
				int count = it.next();
				System.out.println("Case #"+i+": "+count);
				out.println("Case #"+i+": "+count);
				i++;
			}
		} finally {
			out.close();
		}

	}
	public static int count(int N, int S, int p, List<Integer> tl) {
		System.out.print("N="+N+",");
		System.out.print("S="+S+",");
		System.out.println("p="+p+",");
		System.out.println("tl="+tl);
		
		//count
		int count = 0;
		int best = Math.max(S, (p * 3) - 2);
		int supBest = Math.max(S, best -2);
		
		for (Iterator<Integer> it = tl.iterator(); it.hasNext();) {
			int result = it.next();
			if (result >= best) {
				count++;
				continue;
			}
			if (result >= supBest && S >= 1) {
				count++;
				S--;
			}
		}
		System.out.println("count="+count);
		
		return count;
	}

}
