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

public class Solver {
	private static int	VOTES_NB = 3;
	private static int	VARIABLES_NB = 3;
	
	public static Integer[]	solve(Integer[][] input) {
		Integer[]	result = new Integer[input.length];
		
		for (int cnt = 0; cnt < input.length; ++cnt)
			result[cnt] = solve(input[cnt]);
		
		return result;
	}

	public static int	solve(Integer[] input) {
		if (input == null || input.length < 3)
			return 0;
		
		int	googlersNb = input[0];
		int	surprisingTriplets = input[1];
		int	target = input[2];
		
		if (input.length < VARIABLES_NB + googlersNb)
			return 0;
		
		int	result = 0;
		
		Integer[]	candidates = new Integer[surprisingTriplets]; 
		for (int cnt = VARIABLES_NB; cnt < input.length; ++cnt) {
			if (input[cnt] < target * VOTES_NB - (VOTES_NB - 1)) {
				int	minIndex = 0;
				int	min = -1;
				for (int tmp = 0; tmp < candidates.length; ++tmp) {
					if (candidates[tmp] == null || input[cnt] > candidates[tmp]) {
						if (candidates[tmp] == null || min == -1 || candidates[tmp] < min) {
							min = (candidates[tmp] == null) ? 0 : candidates[tmp];
							minIndex = tmp;
						}
					}
				}
				if (min >= 0 && input[cnt] >= min)
					candidates[minIndex] = input[cnt];
			} else
				++result;
		}
		
		if (candidates.length > 0) {
			int	surprisingTarget = target + target - 2 + target - 2;
			if (surprisingTarget <= 0)
				surprisingTarget = target;
			if (candidates != null)
				for (int cnt = 0; cnt < candidates.length; ++cnt)
					if (candidates[cnt] != null && candidates[cnt] >= surprisingTarget)
						result++;
		}
		
		return result;
	}
}
