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

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Googlers {
	public static void main(String[] args) throws IOException 
	{
		Scanner scan = new Scanner(new File("Googlers.in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("Googlers.out")));
		
		
		int N = Integer.valueOf(scan.nextLine());
		int id =1;
		while(scan.hasNextLine())
		{
			String letters = scan.nextLine();
			String[] letter = letters.split(" ");
			
			int peopleNum =  Integer.valueOf(letter[0]);
			int superiNum =  Integer.valueOf(letter[1]);
			int score =  Integer.valueOf(letter[2]);
			int[] scores = new int[peopleNum];
			for(int i=0;i<peopleNum;i++)
			{
				scores[i] = Integer.valueOf(letter[i+3]);
			}
			
			int reslut   = algorithm(peopleNum, superiNum, score, scores);
			out.println("Case #" + id + ": " + reslut);
			
			
			out.println();
			id++;
		}
		out.close();

	}
	
	public static int algorithm(int peopleNum, int superiNum, int score,int[] scores)
	{
		int num = 0;
		int highScores = score * 3 - 2;
		int lowScores  = score * 3 - 4;
		
		//the case score=1
		if(lowScores <= 0) lowScores = 1;
		
		for(int item : scores)
		{
			if(item >= highScores)
				num ++;
			else
			{
				if(superiNum > 0)
				{
					if(item >= lowScores)
					{
						num++;
						superiNum --;
					}
				}
			}
		}

		return num;
	}

}
