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

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;

public class GoogleDance {
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader reader=new BufferedReader(new FileReader(new File(System.getProperty("user.home")+File.separator+"Desktop"+File.separator+"input.txt")));
		PrintWriter output=new PrintWriter(new File(System.getProperty("user.home")+File.separator+"Desktop"+File.separator+"output.txt"));
		int cases=Integer.parseInt(reader.readLine());
		for(int i=0;i<cases;i++){
			output.print("Case #"+(i+1)+": ");
			String[] params=reader.readLine().split("\\s");
			int N=Integer.parseInt(params[0]);
			int S=Integer.parseInt(params[1]);
			int p=Integer.parseInt(params[2]);
			int[] totals=new int[N];
			for(int j=0;j<N;j++){
				totals[j]=Integer.parseInt(params[j+3]);
			}
			Arrays.sort(totals);
			int found=0;
			int track=0;
			int qualified=0;
			while(found<S && track<N){
				if(totals[track]>0){
					if(totals[track]%3==2){
						if((totals[track]/3)+2>=p){
							qualified++;
							found++;
						}
					}else if(totals[track]%3==0){
						if((totals[track]/3)+1>=p){
							qualified++;
							found++;
						}
					}else{
						if(totals[track]/3+1>=p){
							qualified++;
						}
					}
				}
				else{
					if(p==0){
						qualified++;
					}else{
						if(totals[track]%3==1){
							if(totals[track]/3+1>=p){
								qualified++;
							}
						}
					}
				}
				track++;
			}
			while(track<N){
				if(totals[track]>0){
					if(totals[track]%3>=1){
						if(totals[track]/3+1>=p){
							qualified++;
							track++;
							break;
						}
					}else{
						if(totals[track]/3>=p){
							qualified++;
							track++;
							break;
						}
					}
				}else{
					if(p==0){
						qualified++;
						track++;
						break;
					}
				}
				track++;
			}
			if(track<N){
				qualified+=N-track;
			}
			output.print(qualified);
			output.println();
		}
		output.close();
		reader.close();
	}
}