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

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

public class DancingGooglers {

    public static void main(String[] args) {

        String input;
        String output = "";
        int i = 0, googler, div, under, valid, remains;
        int cases, surp, point;
                
        try {  
            FileReader fr = new FileReader(new File("B-small-attempt0.in"));  
            BufferedReader br = new BufferedReader(fr);
            
            FileWriter fstream = new FileWriter("B-small-attempt0.out");
            BufferedWriter out = new BufferedWriter(fstream);

            cases = Integer.parseInt(br.readLine());
            i = 0;

            while(i < cases) {
                input = br.readLine();
                output += "Case #"+(++i)+": "; 
                String[] split = input.split(" ");
                
                surp = Integer.parseInt(split[1]);
                point = Integer.parseInt(split[2]);
                under = 0;
                valid =0;

                for (int j=0; j<Integer.parseInt(split[0]); j++){
                    
                    googler = Integer.parseInt(split[3+j]);
                    div = googler - point*3;
                    remains = googler - point;

                    if((div > -3)&&(remains >= 0)){ valid++; }
                    
                    else if((div > -5)&&(remains >= 0)){ under++; }   
                }
                
                if(under <= surp) { valid += under; }
                else { valid += surp; }

                output += valid;

                out.write(output);
                output = "\n";
            }

            out.close();
            br.close();
            
        }catch (Exception e) { System.err.println("Error: " + e.getMessage()); }
        
    }
}
