/**
 * 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.IOException;
import java.io.InputStreamReader;

/**
 * Google code jam.
 * Qualification Round 2012.
 * Problem B. Dancing With the Googlers
 * 
 * Usage: &lt;app&gt; &lt;input &gt;output
 * 
 * @author sombrabr@gmail.com
 *
 */
public class QualB {
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		
		int cases = new Integer(in.readLine());
		
		run(in, cases);
	}
	
	static void run(BufferedReader in, int cases) throws IOException {
		for(int i=0; i<cases; ++i) {
			String line = in.readLine();

			System.out.print("Case #" + (i+1) + ": ");
			
			String[] parts = line.split(" ");
			
			int j=0;
			int N = Integer.parseInt(parts[j++]); // Number of Googlers
			int S = Integer.parseInt(parts[j++]); // Surprising triplets
			int p = Integer.parseInt(parts[j++]); // Best result base
			
			int tripletScore = p+2*(Math.max(0, p-2)); // Triplet score
			int minimumScore = p+2*(Math.max(0, p-1)); // Minimum score not a triplet
			
			int surprisings = 0; // Total surprisings already found
			
			int googlers = 0; // Count of Googlers with p
			
			for(int k=0; k<N; ++k) {
				int t = Integer.parseInt(parts[j++]); // Total score
				
				if(t>=minimumScore) {
					googlers++;
				} else if(t>=tripletScore && surprisings<S) {
					surprisings++;
					googlers++;
				}
			}
			
			System.out.println(googlers);
		}
	}
}
