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

import java.util.Scanner;
import java.util.StringTokenizer;

public class DancingWiththeGooglers {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int cases = Integer.parseInt(scan.nextLine());
		for (int i = 0; i < cases; i++) {
			String temp = scan.nextLine();
			StringTokenizer token = new StringTokenizer(temp);
			int N = Integer.parseInt(token.nextToken());
			int S = Integer.parseInt(token.nextToken());
			int P = Integer.parseInt(token.nextToken());
			int[] total = new int[N];
			for (int j = 0; j < total.length; j++) {
				total[j] = Integer.parseInt(token.nextToken());
			}
			System.out.println("Case #" + (i + 1) + ": " + solve(total, S, P));

		}

	}

	private static int solve(int[] total, int s, int p) {
		int ser = s;
		int numberOfWinners = 0;
		for (int i = 0; i < total.length; i++) {
			if (total[i] == 0) {
				if (p == 0)
					numberOfWinners++;
			} else if (total[i] == 1) {
				if (p <= 1)
					numberOfWinners++;
			} else if (total[i] == 2) {
				if (p <= 1)
					numberOfWinners++;
				else if (p == 2 && ser > 0) {
					numberOfWinners++;
					ser--;
				}
			} else {
				int k = total[i] % 3;
				if (k == 0) {
					if (total[i] / 3 >= p)
						numberOfWinners++;
					else if (((total[i] / 3) + 1) >= p && ser > 0) {
						numberOfWinners++;
						ser--;
					}
				} else if (k == 2) {
					int sum = (total[i] / 3) + 1;
					if (sum >= p)
						numberOfWinners++;
					else if ((sum + 1) >= p && ser > 0) {
						numberOfWinners++;
						ser--;
					}

				} else if (k == 1) {
					int sum = (total[i] / 3) + 1;
					if (sum >= p)
						numberOfWinners++;
				}
			}
		}
		return numberOfWinners;

	}
}
