import java.io.BufferedWriter;
import java.io.File;
import java.io.FileOutputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Scanner;


public class Dancing_With_the_Googlers {


    /**
     * The first line of the input gives the number of test cases, T.
     *  T test cases follow. 
     *  Each test case consists of a single line containing integers separated by single spaces. 
     *  The first integer will be N, the number of Googlers, and the second integer will be S, the number of surprising triplets of scores. 
     *  The third integer will be p, as described above. Next will be N integers ti: the total points of the Googlers. 
     * @throws IOException
     */
	   public static void main(String[] args) throws IOException {
	        // TODO Auto-generated method stub
			// Reading the input file
			Scanner in = new Scanner(new File("B-large.in"));
			// writting the input file
			FileOutputStream fos = new FileOutputStream("B-large.out");
			PrintStream out = new PrintStream(fos);
	         //Close the output stream
	        int testCase=Integer.parseInt(in.nextLine());
	        for(int i=0;i<testCase;i++) {
	        	out.print("Case #" + (i + 1) + ":\t");
	        	int NoOfGooglers= in.nextInt();
	        	int NoOfSurprisingResults = in.nextInt();
	        	int atLeastP=in.nextInt();
	        	ArrayList<Integer> scores= new ArrayList<Integer>();
        		int BestResults=0;
        		int Surprising=0;
	        	for(int j=0;j<NoOfGooglers;j++)
	        	{
	        		scores.add(in.nextInt());
	        		//System.out.print(scores.get(j));
	        		int modulus=scores.get(j)%3;
	        		int temp = scores.get(j);
	    			switch (modulus) {
					case 0:
						if (((temp / 3) >= atLeastP)) {
							BestResults++;
						} else {
							if (((((temp / 3) + 1) >= atLeastP) && ((temp / 3) >= 1))
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
								
							}
							System.out.println("Case 0"+"itr:"+i+"  surprising:"+temp);
						}
						
						break;
					case 1:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
							continue;
						}
						
						break;
					case 2:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
						} else {
							if (((temp / 3) + 2 >= atLeastP)
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
							}
							System.out.println("Case 2"+"itr:"+i+"  surprising:"+temp);
						}
						break;
					default:
						System.out.println("Error");
					}
	    			
				}// Internal for
				out.println(BestResults);
				// System.out.println(BestResults);
				System.out.println(Surprising);
				BestResults = 0;
			}// for
			in.close();
			out.close();
			fos.close();

	   }
}

package gcjqrpb;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.StringTokenizer;

public class gcjqrpb {

    public static void main(String[] args) {
        //variables
        int T=0;
        ArrayList<Integer> N=new ArrayList<Integer>();
        ArrayList<Integer> S=new ArrayList<Integer>();
        ArrayList<Integer> p=new ArrayList<Integer>();
        ArrayList<ArrayList<Integer>> t=new ArrayList<ArrayList<Integer>>();
        ArrayList<Integer> y=new ArrayList<Integer>();
        //Leo
        File archin=new File(args[0]);
        FileReader in=null;
        BufferedReader bin=null;
        try{
            in=new FileReader(archin);
            bin=new BufferedReader(in);
            T=Integer.parseInt(bin.readLine());
            for(int i=0;i<T;i++){
                StringTokenizer st=new StringTokenizer(bin.readLine());
                N.add(Integer.parseInt(st.nextToken()));
                S.add(Integer.parseInt(st.nextToken()));
                p.add(Integer.parseInt(st.nextToken()));
                t.add(new ArrayList<Integer>());
                for(int j=0;j<N.get(i);j++){
                    t.get(i).add(Integer.parseInt(st.nextToken()));
                }
                y.add(0);
            }
        }catch(Exception ex){
        }finally{
            try{
                bin.close();
            }catch(Exception ex){
            }
            try{
                in.close();
            }catch(Exception ex){
            }
        }
        //Proceso
        for(int i=0;i<T;i++){
            for(int j=0;j<N.get(i);j++){
                if(t.get(i).get(j)>=(3*p.get(i).intValue()-2)){
                    y.set(i,y.get(i)+1);
                }else{
                    if((S.get(i)>0)&&(t.get(i).get(j)>1)&&(t.get(i).get(j)>=(3*p.get(i).intValue()-4))){
                        y.set(i,y.get(i)+1);
                        S.set(i,S.get(i)-1);
                    }
                }
            }
        }
        //Escribo
        File archout=new File("out.txt");
        FileWriter out=null;
        BufferedWriter bout=null;
        try{
            out=new FileWriter(archout);
            bout=new BufferedWriter(out);
            for(int i=0;i<T;i++){
                if(i>0){
                    bout.newLine();
                }
                bout.write("Case #"+(i+1)+": "+y.get(i));
            }
        }catch(Exception ex){
        }finally{
            try{
                bout.close();
            }catch(Exception ex){
            }
            try{
                out.close();
            }catch(Exception ex){
            }
        }
    }
}
