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

import java.util.*;

public class DancingWithGooglers {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		
		final int T = in.nextInt();
		for (int testCase = 1; testCase <= T; ++testCase) {

			// initialize parameters
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			
			int[] t = new int[N];
			for (int i = 0; i < N; ++i)
				t[i] = in.nextInt();
			Arrays.sort(t);
			
			// make as many people as possible >= p
			int overCount = 0;
			for (int i = N - 1; i >=0; --i) {
				int disagree = minDisagreement(t[i], p);
				if (disagree > 2) {
					break;
				} else if (disagree == 2 && S == 0) {
					break;
				} else if (disagree == 2) {
					--S;
				}
				++overCount;
			}
			assert (S == 0);
			System.out.printf("Case #%d: %d\n", testCase, overCount);
			
		}
	}
	
	private static int minDisagreement(int total, int minHighScore) {
		if (total >= 3 * minHighScore)
			return 0;
		else if (total < minHighScore)
			return Integer.MAX_VALUE; //i.e. impossible
		else
			return minHighScore - (total - minHighScore)/2;
	}
	
}
