package com.silverduner.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashMap;

public class Dancing {
	public static void main(String[] args) throws Exception {
		File input = new File("B-small-attempt0.in");
		BufferedReader in = new BufferedReader(new FileReader(input));

		File output = new File("1.out");
		BufferedWriter out = new BufferedWriter(new FileWriter(output));

		// parse input
		int N = Integer.parseInt(in.readLine());
		for(int i=0;i<N;i++) {
			String str = in.readLine();
			out.write("Case #"+(i+1)+": ");
			System.out.println("-------");
			String[] words = str.split(" ");
			int n = Integer.parseInt(words[0]);
			int suprise = Integer.parseInt(words[1]);
			int threshold = Integer.parseInt(words[2]);
			int[] scores = new int[n];
			for(int j=0;j<n;j++) {
				scores[j] = Integer.parseInt(words[3+j]);
			}
			int count = 0;
			for(int score : scores) {
				int a,b,c;
				boolean find = false;
				boolean sfind = false;
				for(a = 10; a>=0 && !find; a--) {
					if(3*a-4>score)
						continue;
					for(b = a; b>=0 && b >=a-2 && !find; b--) {
						for(c = b; c>=0 && c >=b-2 && c >=a-2 && !find; c--) {
							System.out.println(a+","+b+","+c);
							if(a+b+c==score) {
								if(a >= threshold) {
									if(a-c <= 1){
										count++;
										find = true;
										System.out.println("find!");
									}
									else if(a-c == 2){
										sfind = true;
										System.out.println("suprise!");
									}
								}
							}
							
						}
					}
				}
				if(!find && sfind && suprise > 0)
				{
					count++;
					suprise --;
				}
			}
			int maxCount = count;
			out.write(maxCount+"\n");
		}
		out.flush();
		out.close();
		in.close();
	}
}

package qualifying;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;

public class B {

	public static String solve(int N, int S, int p, int[] t) {
		
		int cnt = 0;
		
		for(int i=0; i<t.length; i++) {
			if(t[i]>=2*Math.max(p-1,0)+p) cnt++;
			if(t[i]<2*Math.max(0,p-1)+p && t[i]>=2*Math.max(0,p-2)+p) { 
				if(S>0) {
					cnt++;
					S--;
				}
			}
		}
		
		
		return Integer.toString(cnt);
	}
	
	
	public static void main(String[] args) throws Exception {
		
		String fs_in = "/Users/ctynan/Downloads/test.txt";
		String fs_out = "/Users/ctynan/Documents/B-out.txt";
		String line;
		BufferedReader br = new BufferedReader(new FileReader(fs_in));
		BufferedWriter bw = new BufferedWriter(new FileWriter(fs_out));
		
		line=br.readLine();
		line=line.toLowerCase();
		int tst = Integer.valueOf(line);
		
		for(int ii=0;ii<tst; ii++) {
			line=br.readLine();
			String output = "Case #" + Integer.toString(ii+1) +": ";
			String[] tem = line.split(" ");
			int N = Integer.valueOf(tem[0]);
			int S = Integer.valueOf(tem[1]);
			int p = Integer.valueOf(tem[2]);
			int[] t = new int[N];
			for(int i=3; i<tem.length; i++) {
				t[i-3] = Integer.valueOf(tem[i]);
			}
			
			String res = solve(N,S,p,t);
			bw.write(output+res);
			if(ii<tst-1) bw.write('\n');
		}
		bw.close();
		return;
	}
}
