import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;


public class Dancing_improved {
	
	static int f_Superan_limites(String params){
		  int superan_limite=0;
		  String[] parametros=params.split(" ");
		  
		  int n_participantes= Integer.parseInt(parametros[0]);
		  int n_sorprendidos= Integer.parseInt(parametros[1]);
		  int nota_limite= Integer.parseInt(parametros[2]);
		  
		  int suma_notas, resto, nota_juego;
		  for(int i=3;i<parametros.length;i++){ // Recorro las sumas de los participantes
			  
			  suma_notas=Integer.parseInt(parametros[i]);
			  resto=suma_notas%3;
			  
			  if(resto==0){ // el resto es el número triplicado!
				  nota_juego=suma_notas/3;
				  if(nota_juego>=nota_limite){
					  superan_limite++;
				  }else if(nota_juego-1>=0 && n_sorprendidos>0 && ((nota_juego+1)>=nota_limite || (nota_juego+2)>=nota_limite)){ // no supera el límite pero podría hacerlo si quedan sorprendidos
					  n_sorprendidos--;
					  superan_limite++;
				  }
			  }else if((suma_notas+1)%3==0){ // Tendré que jugar con el valor en +-1
				  nota_juego=(suma_notas+1)/3;
				  if(nota_juego-1>=0 && nota_juego>=nota_limite){
					  superan_limite++;
				  }else if(nota_juego-1>=0 && n_sorprendidos>0 && (nota_juego+1)>=nota_limite){
					  n_sorprendidos--;
					  superan_limite++;
				  }
			  }else if((suma_notas+2)%3==0){ // Tendré que jugar con el valor en +-2
				  nota_juego=(suma_notas+2)/3;
				  if(nota_juego-1>=0 && nota_juego>=nota_limite){
					  superan_limite++;
				  }		  
			  }			  
		  }
		  return superan_limite;
	}
	
	public static void main(String[] args) throws IOException {
		FileReader fr = new FileReader(args[0]);
		BufferedReader bf = new BufferedReader(fr);
		int ntest=0;
		
		FileWriter fstream = new FileWriter("out.txt");
		BufferedWriter out = new BufferedWriter(fstream);
		
		String lines = bf.readLine();
		String liner, linew;
		int lines_r=0;
		String[] numbers;
		int total;
		
		while((liner = bf.readLine())!=null && lines_r<=Integer.parseInt(lines)) {
			ntest++;
			numbers=liner.split(" ");
			total=f_Superan_limites(liner);
			linew="Case #"+ntest+": "+total+"\n";
			out.write(linew);
			lines_r++;
		}
		out.close();
		fr.close();
	}
}

package codejam2012;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;

/**
 *
 * @author devashish
 */
public class ProblemB {

    public static void main(String[] args) {
        StringTokenizer st = null;
        BufferedReader in;
        PrintWriter out = null;
        try {
            in = new BufferedReader(new FileReader(new File("E:/b.in")));
            out = new PrintWriter(new FileWriter(new File("E:/b.out")));

            while (st == null || !st.hasMoreTokens()) {
                st = new StringTokenizer(in.readLine());
            }
            int t = Integer.parseInt(st.nextToken());
            for (int i = 1; i <= t; i++) {
                while (st == null || !st.hasMoreTokens()) {
                    st = new StringTokenizer(in.readLine());
                }

                int N = Integer.parseInt(st.nextToken());
                int S = Integer.parseInt(st.nextToken());
                int p = Integer.parseInt(st.nextToken());
                int[] T = new int[N];
                for (int j = 0; j < N; j++) {
                    T[j] = Integer.parseInt(st.nextToken());
                }

                int outputLine = maxGooglers(N, S, p, T);

                out.print("Case #" + i + ": " + outputLine + "\n");
            }
        } catch (IOException e) {
        }
        out.flush();
    }

    private static int maxGooglers(int N, int S, int p, int[] T) {
        int output = 0;

        int surprisingMinScore = Math.max(3 * p - 4, 0) ;
        int nonSurprisingMinScore = Math.max(3 * p - 2, 0);
        int countSurprise = 0;
        
       // System.out.println(surprisingMinScore);
       // System.out.println(nonSurprisingMinScore);

        for (int i = 0; i < T.length; i++) {
            //    System.out.println(T[i]);            
         //   System.out.println("T[i]: " + T[i]);
            if (T[i] < surprisingMinScore) {
                continue;
            } else if (T[i] >= surprisingMinScore && T[i] < nonSurprisingMinScore) {
                //either surprising or low scores
                //countSurprise += findPossibleSurprisingScoresWithBestResult(T[i], p);
                if (S > 0 && T[i] >= 2) {
                    countSurprise += findPossibleSurprisingScoresWithBestResult(T[i], p);
           //         System.out.println("#countSurprise: " + countSurprise);
                    //output += findPossibleSurprisingScoresWithBestResult(T[i], p);
                }                
            } else if (T[i] >= nonSurprisingMinScore) {
                //Non surprising score
                //System.out.println("non surprising score.");
                output++;
            }          
        }
        
        //System.out.println("#output: " + output);
        //System.out.println((countSurprise < S ? countSurprise : S));
        return output + (countSurprise < S ? countSurprise : S);
    }
    
    private static int findPossibleSurprisingScoresWithBestResult(int t, int p) {
        int count = 0;
        int a = t/3;
        int b = ((t + 4)/3);

        if (p >= a && p <=b) {
            count++;
        }
        //System.out.println("#count:" + count);
        return count;
    }
}
