/**
 * 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.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithGooglers {

	/**
	 * @param args
	 */
	private final static String WRITE_DEST = "C:\\Users\\mkobit\\Documents\\GoogleCodeJam2012\\Dancing With the Googlers\\out.txt";
	public static void main(String[] args) {
		int T;	// T test cases
		int N;	// number of Googlers
		int S;	// surprising number of scores
		int p;	// best result score
		int howManyP = 0;
		BufferedReader in;
		PrintWriter outfile;
		try {
			in = new BufferedReader(new FileReader(args[0]));
			outfile = new PrintWriter(new FileWriter(WRITE_DEST));
			String text = in.readLine();
			T = Integer.parseInt(text);
			for (int i = 0; i < T; i++) {
				// for each test case
				howManyP = 0;
				text = in.readLine();
				//System.out.println(text);
				StringTokenizer token = new StringTokenizer(text, " ");
				N = Integer.parseInt(token.nextToken());
				S = Integer.parseInt(token.nextToken());
				p = Integer.parseInt(token.nextToken());
				//System.out.println(N);
				//System.out.println(S);
				//System.out.println("case=" + (i+1) + " p=" + p + " strange=" + S);
				while (token.hasMoreTokens()) {
					String s = token.nextToken();
					//System.out.print(s + " ");
					int score = Integer.parseInt(s);
					Googler goog = new Googler(score);
					if (goog.hasHighScore(p)) {
						//System.out.print(goog + " ");
						howManyP++;
					} else if (S > 0 && goog.weirdHighScore(p)) {
						//System.out.print(goog + " ");
						howManyP++;
						S--;
					} else {
						//System.out.print(goog + " ");
					}
				}
				//System.out.println("withp=" + howManyP);
				// write output to file
				String s = String.format("Case #%d: %d\n", i + 1, howManyP);
				outfile.write(s);
				//System.out.println(howManyP);
			}
			in.close();
			outfile.close();
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} 
	}
}
