/**
 * 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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;


public class Dancing
{
	/**
	 * @param args
	 */
	public static void main(String[] args)
	{
		try {
			FileReader fs = new FileReader("/tmp/dancing.in");
			BufferedReader in = new BufferedReader(fs);
			FileWriter fso = new FileWriter("/tmp/dancing.out");
			BufferedWriter out = new BufferedWriter(fso);

			String strLine;
			int i=0;
			int matches;

			while ((strLine = in.readLine()) != null)
			{
				if (i > 0) {
					// parse input line
					String[] strings = strLine.split(" ");
					final int[] ints = new int[strings.length];
					for (int j = 0; j < strings.length; j++) {
						ints[j] = Integer.parseInt(strings[j]);
					}

					matches = findMatches(ints[1], ints[2], Arrays.copyOfRange(ints, 3, 3+ints[0]));

					out.write(new StringBuilder("Case #").append(i)
							.append(": ").append(matches).append("\n")
							.toString());
				}
				i++;
			}

			in.close();
			out.close();
		} catch (Exception e) {// Catch exception if any
			System.err.println("Error: " + e.getMessage());
		}
	}

	private static int findMatches(int surprises, int bestResult, int[] ts)
	{
		int matches = 0;

		List<Integer> totalScores = new ArrayList<Integer>(ts.length);
		for (int index = 0; index < ts.length; index++){
			totalScores.add(ts[index]);
	    }
		Collections.sort(totalScores, Collections.reverseOrder());
		System.out.print("Surprises: " + surprises + " Best: " + bestResult + " Scores: " + totalScores);

		for (int totalScore : totalScores)
		{
			int min = totalScore / 3;
			int delta = totalScore % 3;
			int max = min + delta;

			System.out.print(" [Min: " + min + " / Max: " + max + "]");

			if ((max == bestResult) && (delta == 2) && (surprises > 0)) {
				matches++;
				surprises--;
			} else if ((min + 1 == bestResult) && (max + 1 == bestResult) && (min > 0) && (surprises > 0)) {
				matches++;
				surprises--;
			} else if ((min + 1 >= bestResult) && (max >= bestResult)) {
				matches++;
			}
		}

		System.out.println(" Result: " + matches);
		return matches;
	}
}