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

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Map;
import java.util.Scanner;

public class TB {

	private Map<Character, Character> translate = null;
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		try {
			File file = new File("src/qualifier/B-small-attempt0.in");
			String a = file.getAbsolutePath();
			in = new Scanner(file);
			out = new PrintWriter(new File("src/qualifier/B-small-attempt0.out"));
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
		TB worker = new TB();
		int n = in.nextInt();
		
		for (int i=1; i<=n; i++) {
			int k = in.nextInt();
			int s = in.nextInt();
			int p = in.nextInt();
			
			int[] scores = new int[k];
			for (int j=0;j<k;j++) {
				scores[j] = in.nextInt();
			}
			out.println("Case #" + i + ": " + worker.maxGs(k,p,s,scores));
		}
		out.flush();
	}
	
	public int maxGs(int k, int p, int s, int[] scores) {
		int res = 0;
		int subres = 0;
		int acceptable = 3*p-4;
		if (p == 1) acceptable = 1;
		for (int i=0; i<k; i++)
			if (scores[i]>=3*p-2) 
				res++;
			else if (scores[i]>=acceptable) subres++;
			
		res += Math.min(subres, s);
		return res;
	}
}
