/**
 * 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.*;
import java.util.*;

class Triplet
{
	public static void main (String [] args) throws IOException 
	{
		BufferedReader in = new BufferedReader(new FileReader("B-small-attempt0.in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("B-small-attempt0.out")));
		
		StringTokenizer st = new StringTokenizer(in.readLine());
		int numCases = Integer.parseInt(st.nextToken());
		
		for (int i = 0; i < numCases; i++)
		{
			out.print("Case #" + (i+1) + ": ");
			
			st = new StringTokenizer(in.readLine());
			
			int n = Integer.parseInt(st.nextToken());
			int numSurprisings = Integer.parseInt(st.nextToken());
			int P = Integer.parseInt(st.nextToken());
			
			int min = 0;
			int minNoSurprising = 0;
			
			if (P > 1)
			{
				min = 3*P - 4;
				minNoSurprising = 3*P - 2;
			}
			else if (P == 1)
			{
				min = 1;
				minNoSurprising = 1;
			}
			else
			{
				min = 0;
				minNoSurprising = 0;
			}
			
			int[] totalPoint = new int[n];
			
			for (int j = 0; j < n; j++)
			{
				totalPoint[j] = Integer.parseInt(st.nextToken());
			}
			
			int maxCandidateWithNoSurprisings = 0;
			int maxCandidateWithSurprisings = 0;
			
			for (int j = 0; j < n; j++)
			{
				if (totalPoint[j] >= minNoSurprising)
				{
					maxCandidateWithNoSurprisings++;
				}
				else if (totalPoint[j] >= min)
				{
					maxCandidateWithSurprisings++;
				}
			}
			
			if (maxCandidateWithSurprisings <= numSurprisings)
			{
				out.print((maxCandidateWithNoSurprisings + maxCandidateWithSurprisings));
			}
			else
			{
				out.print((maxCandidateWithNoSurprisings + numSurprisings));
			}
			
			out.println();
		}
		
		out.close();
	}
}