/**
 * 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 problemB;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;

public class DancingWithTheGooglers {
	final static String DIRECTORY = "ioFile";
	
	final static String FNAME = "B-small-attempt2";

	public BufferedReader in;

	public PrintWriter out;

	void open() throws IOException {
		in = new BufferedReader( new FileReader( new File( DIRECTORY + "/" + FNAME + ".in" ) ) );
		out = new PrintWriter( new File( DIRECTORY + "/" +  FNAME + ".out" ) );
	}

	void close() throws IOException {
		out.close();
	}
	
	void run() throws IOException {
		String nac = in.readLine();		
		for (int i=0; i<Integer.parseInt(nac); i++){
			int count = 0;
			String line = in.readLine();
			String [] sa = line.split(" ");
			int n = Integer.parseInt(sa[0]);
			int s = Integer.parseInt(sa[1]);
			int p = Integer.parseInt(sa[2]);
			List<Integer> list = new ArrayList<Integer>();
			for ( int j = 3; j < sa.length; j++) {
				list.add(Integer.parseInt(sa[j]));				
			}
			for ( int j =0; j<n && s>=0; j++) {
				int num = list.get(j);
				if ( num % 3 == 0) {
					if ( num/3 >= p)
						count ++;
					else if (num > 0 && s>0 &&  num/3+1 >=p) {
						s--;
						count++;
					}
				}
				else if ( num % 3 == 1 && num/3 +1 >=p	) {
					count ++;
				}
				else if ( num % 3 == 2 ) {
					if ( num/3 +1 >= p) 
						count ++;
					else if (s>0 &&  num/3 + 2 >=p ) {
						s--;
						count ++;
					}						
				}
//				if ( (num/3 ) >= p) 
//					count ++;
//				else if (num > 0 && s>0 && (num/3 + 2) >=p ) {
//					s--;
//					count++;
//				}
			}
			out.println("Case #" + (i+1) + ": " + count);
		}		
	}
	
	int count(String sNumber, char ch){
		int count=0;
		for(int i=0;i<sNumber.length();i++){
			if(sNumber.charAt(i)==ch)
				count++;
		}
		return count;
	}
	
	public static void main( String[] args ) throws IOException {
		new Thread() {

			public void run() {
				try {
					DancingWithTheGooglers solution = new DancingWithTheGooglers();
					solution.open();
					solution.run();
					solution.close();
				} catch ( Exception e ) {
					throw new RuntimeException( e );
				}
			}
		}.start();
	}
}
