/**
 * Created by IntelliJ IDEA.
 * User: Administrator
 * Date: 3/3/12
 * Time: 11:00 AM
 * To change this template use File | Settings | File Templates.
 */

import SRMLib.MathLibrary;
import SRMLib.TestSRMLib;
import com.sun.org.apache.bcel.internal.generic.F2D;

import java.io.*;
import java.util.*;
import java.util.zip.Inflater;

public class SRM {
    public static void main(String[] args) throws IOException {
        //TestSRMLib.run();
        codeJam1.main();

        return;
    }
}
class codeJam1 {
    public static void main() throws IOException {
        String inputPath = "E:\\input.txt";
        String outputPath = "E:\\output.txt";
        BufferedReader input = new BufferedReader(new FileReader(inputPath));
        BufferedWriter output = new BufferedWriter(new FileWriter(outputPath));

        String line;
        line = input.readLine();
        int T = Integer.parseInt(line);
        for (int i = 1; i <= T; ++i) {
            line = input.readLine();
            String[] words = line.split(" ");
            int N = Integer.parseInt(words[0]);
            int S = Integer.parseInt(words[1]);
            int p = Integer.parseInt(words[2]);
            int n = 0;
            int res = 0;

            for (int j = 3; j < words.length; ++j) {
                if (p == 0) {
                    res++;
                    continue;
                }

                int t = Integer.parseInt(words[j]);
                if (p == 1) {
                    if (t > 0)
                        res++;
                    continue;
                }
                if (t >= 3 * p - 2)
                    res++;
                else if (t >= 3 * p - 4)
                    n++;
            }

            res += Math.min(n, S);
            output.write("Case #" + i + ": " + res);
            output.newLine();
        }

        input.close();
        output.close();
    }
}

package at.neiti.codejam2012;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.HashMap;
import java.util.Map;

public class DancingWithTheGooglers {

	public static void main(String[] args) throws IOException {
		BufferedReader r = new BufferedReader(new FileReader("B-small-attempt0.in"));
		int n = Integer.parseInt(r.readLine());
	
		StringBuilder output = new StringBuilder();
		for(int i=0; i<n; i++) {
			String line = "Case #" + (i+1) + ": ";
			
			String tokens[] = r.readLine().split(" ");
			int numGooglers = Integer.parseInt(tokens[0]);
			int surprising = Integer.parseInt(tokens[1]);
			int p = Integer.parseInt(tokens[2]);
			
			int googlersGreaterP = 0;
			for(int j=3; j<tokens.length; j++) {
				int total = Integer.parseInt(tokens[j]);
				
				//See if Googler points are > p not surprising
				int bestNotSurprising = total/3 + (total%3 != 0 ? 1 : 0);
				if(bestNotSurprising >= p) {
					googlersGreaterP++;
					continue;
				}
				
				//See if Googler points are > p surprising
				if(surprising > 0) {
					int add = 0;
					if(total%3 == 0) {
						add = 1;
					} else if(total%3 == 2) {
						add = 2;
					}
					int bestSurprising = total == 0 ? 0 : total/3 + add;
					if(bestSurprising >= p) {
						googlersGreaterP++;
						surprising--;
					}
				}
			}
			
			line += googlersGreaterP + "\n";
			output.append(line);
		}
		
		r.close();
		
		FileWriter fw = new FileWriter("output_dancing.txt");
		fw.write(output.toString());
		fw.flush();
		fw.close();
	}
	
}

