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 hk.polyu.cslhu.codejam.solution.impl.qualificationround;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

import hk.polyu.cslhu.codejam.solution.Solution;

import org.apache.log4j.Logger;

public class SpeakingInTongues extends Solution {
	private Map<String, String> codeMap;
	private String oriText;
	
	private void setCodeMap() {
		this.codeMap = new HashMap<String, String>();
		codeMap.put("y", "a");
		codeMap.put("e", "o");
		codeMap.put("q", "z");
		codeMap.put("z", "q");
		
		List<String> oriTextList = new ArrayList<String>();
		oriTextList.add("ejp mysljylc kd kxveddknmc re jsicpdrysi");
		oriTextList.add("rbcpc ypc rtcsra dkh wyfrepkym veddknkmkrkcd");
		oriTextList.add("de kr kd eoya kw aej tysr re ujdr lkgc jv");
		
		List<String> encodedTextList = new ArrayList<String>();
		encodedTextList.add("our language is impossible to understand");
		encodedTextList.add("there are twenty six factorial possibilities");
		encodedTextList.add("so it is okay if you want to just give up");
		
		for (int i = 0; i < oriTextList.size(); i++) {
			String oriText = oriTextList.get(i);
			String encodedText = encodedTextList.get(i);
			
			for (int j = 0; j < oriText.length(); j++) {
				String ori = oriText.substring(j, j + 1);
				String encoded = encodedText.substring(j, j + 1);
				
				if (ori.equals(" "))
					continue;
				
				if (! codeMap.containsKey(ori))
					codeMap.put(ori, encoded);
				else if (! codeMap.get(ori).equals(encoded))
					logger.error("Found duplicate encoded string for input " + ori);
			}
		}
		
		logger.info("The size of code map is " + this.codeMap.size());
	}
	
	@Override
	public void setProblem(List<String> problemDesc) {
		// TODO Auto-generated method stub
		this.oriText = problemDesc.get(0);
	}

	@Override
	public void solve() {
		// TODO Auto-generated method stub
		this.setCodeMap();
		
		this.result = "";
		
		for (int i = 0; i < this.oriText.length(); i++) {
			String ori = this.oriText.substring(i, i + 1);
			
			if (ori.equals(" "))
				this.result += ori;
			else if (this.codeMap.containsKey(ori))
				this.result += this.codeMap.get(ori);
			else
				logger.error("Failure to find the encoded string for " + ori);
		}
	}
}
