/**
 * 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 codejam.round1;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

public class ProblemB {
	public static void main(String[] args) throws Exception {
		BufferedReader reader = new BufferedReader(new FileReader(args[0]));
		PrintStream out = new PrintStream(args[1]);

		int testsCount = Integer.parseInt(reader.readLine());
		for (int test = 1; test <= testsCount; test++) {
			String input = reader.readLine();
			StringTokenizer tokenizer = new StringTokenizer(input);
			int N = Integer.parseInt(tokenizer.nextToken());
			int S = Integer.parseInt(tokenizer.nextToken());
			int p = Integer.parseInt(tokenizer.nextToken());
			List<Integer> nonSurprisingExceedingP = new ArrayList<Integer>();
			List<Integer> suprisingExceedingP = new ArrayList<Integer>();
			for (int i = 0; i < N; i++) {
				int ti = Integer.parseInt(tokenizer.nextToken());
				if (bestNonSuprisingSolution(ti) >= p) {
					nonSurprisingExceedingP.add(i);
				}else if(hasSuprisingSolution(ti) && bestSuprisingSolution(ti) >=p) {
					suprisingExceedingP.add(i);
				}
			}
			int googlersCount = nonSurprisingExceedingP.size() + Math.min(S, suprisingExceedingP.size());
			out.println(String.format("Case #%s: %s", test, googlersCount));
		}

		out.close();
		reader.close();
	}

	private static int nearestUpperMultipleOfThree(int a) {
		if (a == 0 || a % 3 == 0) {
			return a;
		}
		return a + (3 - (a % 3));
	}

	private static int nearestMultipleOfThree(int a) {
		if (a == 0 || a % 3 == 0) {
			return a;
		}
		if (a % 3 == 1) {
			return a - 1;
		}
		return a + 1;
	}

	private static int bestNonSuprisingSolution(int total) {
		return nearestUpperMultipleOfThree(total) / 3;
	}

	private static boolean hasSuprisingSolution(int total) {
		return total > 1;
	}

	private static int bestSuprisingSolution(int total) {
		return (nearestMultipleOfThree(total) / 3) + 1;
	}
}
