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 googlecodejam;

import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.Scanner;

public class GoogleCodeJam {
    
    public static int calcGooglers(int p, int s, int[] g) {
        int avg = p*3;
        int n = g.length;
        int cont = 0;
        for (int i = 0; i< n; i++) {
            if (g[i] >= avg ) {
                cont++;
            } else if (avg == 0){
                cont++;
            } else if (g[i] >= avg-2 && avg-2 >= p) {
                cont++;
            } else if (g[i] >= avg-4 && avg-4 >= p) {
                if (s > 0) {
                    cont++;
                    s--;
                }
            }
        }
        return cont;
    }
    
    public static void doIt() throws Exception {
        Scanner sc = new Scanner(new FileReader("/home/fuelusumar/input.txt"));
        PrintWriter pw = new PrintWriter(new FileWriter("/home/fuelusumar/output.txt"));
        int caseCnt = sc.nextInt();
        for (int caseNum = 0; caseNum < caseCnt; caseNum++) {
            pw.print("Case #" + (caseNum + 1) + ": ");
            /***********************************************/
            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();
            int[] g = new int[n];
            for (int googler = 0; googler < n; googler++) {
                g[googler] = sc.nextInt();
            }
            /***********************************************/
            pw.println(calcGooglers(p,s,g));
        }
        pw.flush();
        pw.close();
        sc.close();
    }
    
    
    public static void main(String[] args) throws Exception {
        doIt();
    }
}
