/**
 * 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 org.pokuri;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

/**
 * @author Pokuri
 * @since Apr 14, 2012
 * org.pokuri.Googlers
 */
public class Googlers{
	
	private BufferedReader reader = null;

	/**
	 * @param filePath
	 * @return
	 */
	protected void openFile(String filePath){
		try {
			reader = new BufferedReader(new FileReader(new File(filePath)));			
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
	
	protected void closeFile(){
		try {
			reader.close();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
	
	protected BufferedWriter openOutputFile(String filePath){
		try {
			return new BufferedWriter(new FileWriter(new File(filePath)));
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		return null;
	}
	
	protected int noOfTestCases(){
		try {
			return Integer.parseInt(reader.readLine());
		} catch (NumberFormatException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		return 0;
	}
	
	protected String nextCase(){
		try {
			return reader.readLine();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		return null;
	}

	protected void generateOutput() throws IOException {
		
		openFile("input/Googlers.input");
		int cases = noOfTestCases();
		BufferedWriter outputFile = openOutputFile("output/Googlers.txt");
		for(int i=1; i<=cases; i++){			
			String nextCase = nextCase();
			String[] split = nextCase.split(" ");			
			int noOfSurprises = Integer.parseInt(split[1]);
			int minBestScore = Integer.parseInt(split[2]);
			
			int bestScoreGooglers = 0;
			// for each score find it'shad best score or not
			for(int k=3; k<split.length; k++){
				// check that the score can have best score in it
				int score = Integer.parseInt(split[k]);
				// first check that score is greater than or equal to the min.best score
				if(score >= minBestScore){
					// now find the max score that can be when all triplets are min.best score
					int multiplied = minBestScore*3;
					// if score is more than sum of tripltes -2 then we can arrange them to form at lest a best score in it
					if(score >= multiplied - 2){
						bestScoreGooglers++;
					}
					// if not found then check we left with any surprises of not. 
					// the use that surpeise to make that score good enough for forming min.best score in triplets
					else if(noOfSurprises > 0 && score >= multiplied - 4){
						bestScoreGooglers++;
						noOfSurprises--;
					}
				}								
			}
			outputFile.write("Case #"+i+": "+bestScoreGooglers);
			outputFile.newLine();
		}
		outputFile.flush();
		outputFile.close();
		closeFile();
		
	}
	
	public static void main(String[] args) throws IOException {
		
		Googlers googlers = new Googlers();
		googlers.generateOutput();
		
	}	
	
}
