/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}

package gcj;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.StringTokenizer;

public class DancingWithTheGooglers {

	/**
	 * @param args
	 */

	private static int[] values = null;
	private static int[] googlers= null;
	private static int total =0;
	
	public static void main(String[] args) {
		
		BufferedReader fin = null;
		int t = 0;
		StringTokenizer str = null;
		
		try {
			fin = new BufferedReader(new FileReader(new File("B-small-attempt1.in")));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
		
	
			
			try {
				t = Integer.parseInt(fin.readLine());
				//System.out.println(t);
			} catch (NumberFormatException e) {
				e.printStackTrace();
			} catch (IOException e) {
				e.printStackTrace();
			}
			
			values = new int[3];
			
			
			for(int i=0;i<t;i++){
				System.out.print("Case #"+(i+1)+": ");
				try {
					total = 0;
					str=new StringTokenizer(fin.readLine());
					
					int ctr =0;
				while(ctr<3) {
					 
					values[ctr]=Integer.parseInt(str.nextToken());
					ctr++;
					
					}
				//System.out.print(values[0]+" "+values[1]+" "+values[2]+" ");
				ctr=0;
				googlers = new int[values[0]];
				while(str.hasMoreElements()){
					googlers[ctr]=Integer.parseInt(str.nextToken());
					//System.out.print(googlers[ctr]+" ");
					ctr++;
				}
				//System.out.println();
					
				} catch (IOException e) {
					e.printStackTrace();
				}
				
				calculate();
				
			}
	}


	private static void calculate() {
		
		int value = 0 ;
		int remainder = 0;
		for(int i=0;i<values[0];i++){ //values[1] is the number of surprising solutions
									  //values[2] is p
									  //values[0] is number of cases
									  //googlers is the totals of the each googler 
									  //value is the division of total by 3	
			
			value = googlers[i]/3;
			remainder = googlers[i]%3;
			
			if (googlers[i]==0&&values[2]!=0)
				continue;
			
			if(value>=values[2])
				total++;
			else if(remainder==0&&values[1]>0&&(value+1)>=values[2]){
				values[1]--;
				total++;
			}
			else if(remainder>0&&(value+1)>=values[2])
				total++;
			
			else if(remainder==2&&(value+2)>=values[2]&&values[1]>0){
				total++;
				values[1]--;
			}	
		}
		System.out.println(total);
	}

}
