/**
 * 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();
    }
}

import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.List;
import java.util.Map;

import com.google.common.collect.ImmutableMap;
import com.google.common.collect.Lists;
import com.google.common.io.LineReader;


public class DancingWithGooglers {

	public static void main(String[] args) throws NumberFormatException, IOException {
		LineReader lineReader = new LineReader(new FileReader(args[0]));
		FileWriter out = new FileWriter(args[0] + "-out.txt"); 
		
		int t = Integer.parseInt(lineReader.readLine());
		for (int counter = 1; counter <= t; counter++) {
			String[] nums = lineReader.readLine().split(" ");
			int surprisingTriplets = Integer.parseInt(nums[1]);
			int bestResultMin = Integer.parseInt(nums[2]);
			List<Integer> totals = Lists.newArrayList();
			for (int i = 3; i < nums.length; i++) {
				totals.add(Integer.parseInt(nums[i]));
			}
			
			int result = compute(surprisingTriplets, bestResultMin, totals);
			out.write(String.format("Case #%d: %d\n", counter, result));
		}
		out.close();
	}

	private static int compute(int surprisingTriplets, int bestResultMin, List<Integer> totals) {
		// surpr = 1, bestMin = 5 | 15 13 11
		// 5, 3, 3 = 11 - surpr. min 
		// 5, 4, 4 = 13 - norm. min
		
		int surprMin = bestResultMin + 2 * Math.max(bestResultMin - 2, 0);
		int normMin = bestResultMin + 2 * Math.max(bestResultMin - 1, 0);
		
		int count = 0;
		for (int t : totals) {
			if (t >= normMin) {
				count++;
			} else if (t >= surprMin && surprisingTriplets > 0) {
				count++;
				surprisingTriplets--;
			}
		}
		
		return count;
	}


}
