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

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class A_sl_Dansing {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		try {
			Scanner inp = new Scanner(new FileInputStream("A_s_input.txt"));
			int i=0,j=0,k=0,tc=0;
			int T = inp.nextInt();
			inp.nextLine();
			for(tc=0;tc<T;tc++){
				int N = inp.nextInt();
				int S = inp.nextInt();
				int P = inp.nextInt();
				int arr[] = new int[N];
				
				for(i=0;i<N;i++){
					arr[i] = inp.nextInt();
				}
				
				inp.nextLine();
				
				int arr1[] = new int[N];
				int arr2[] = new int[N];
				
				for(i=0;i<N;i++){
					arr1[i] = arr[i]/3;
					arr2[i] = arr[i] % 3;
				}
				
				int result = 0;
				for(i=0;i<N;i++){
					if(arr2[i] == 0){
						if(arr1[i] >= P){
							result++;
						}
						else if(arr1[i]+1 == P && arr1[i] != 0 && S>0){
							S--;
							result++;
						}
					}
					else if(arr2[i] == 1 && arr1[i]+1 >= P){
						result++;
					}
					else if(arr2[i] == 2){
						if(arr1[i]+1 >= P){
							result++;
						}
						else if(arr1[i]+2 == P && S>0){
							result++;
							S--;
						}
					}
				}
				
				k=tc+1;
				System.out.println("Case #" + k +": "+result);
				
			}
			
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
	}

}
