/**
 * 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 com.qual2;

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.List;

public class qual2 {

	public static void main(String[] args) {
		cNums h = new cNums();
		FileInputStream fis;
		try {
			fis = new FileInputStream("B-small-attempt0.in");
			FileOutputStream fos = new FileOutputStream("smallB.txt");
			
			BufferedReader br = new BufferedReader(new InputStreamReader(fis));
			
			int lines = Integer.parseInt(br.readLine());
			String outp = null;
			String inp;
			
			for(int i = 0; i < lines; i++) {
				inp = br.readLine();
				String[] inpar = inp.split(" ");
				
				int lim = Integer.parseInt(inpar[2]);
				int surp = Integer.parseInt(inpar[1]);
				int numbestn = 0;
				int numpossbests = 0;
				for(int a = 3; a < inpar.length; a++) {
					int curr = Integer.parseInt(inpar[a]);
					if(h.bestn[curr] >= lim)
						numbestn++;
					else if(h.bests[curr] >= lim)
						numpossbests++;
				}
				outp = "Case #" + (i+1) + ": ";
				outp += (numbestn + Math.min(surp, numpossbests));
				outp += "\n";
				fos.write(outp.getBytes());
				
			}
			fis.close();
			fos.close();
			
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
}

final class cNums {
	public int[] bestn;
	public int[] bests;
	
	public cNums() {
		bestn = new int[31];
		bests = new int[31];
		FindBests();
	}
	
	private void FindBests() {
		bestn[0] = 0;
		bests[0] = 0;
		for(int i = 1; i < 31; i++) {
			int mod = i % 3;
			bestn[i] = i / 3;
			if(mod == 0)
				bests[i] = bestn[i] + 1;
			else if(mod == 1)
				bests[i] = ++bestn[i];
			else if(mod == 2)
				bests[i] = ++bestn[i] + 1;
		}
	}
}