/*
 * 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 dancing;
import java.io.*;
import java.util.StringTokenizer;
import java.util.HashSet;

class Solucion{
    int solucion(String datos){
        int ret = 0;
        int ok = 0;
        int posiblesorpresa = 0;
        
        StringTokenizer tk = new StringTokenizer(datos);
        int jug = Integer.parseInt(tk.nextToken());
        int sorpresas = Integer.parseInt(tk.nextToken());
        int minimo = Integer.parseInt(tk.nextToken());
        
        for (int i=0;i<jug;i++){
            int triple = Integer.parseInt(tk.nextToken());
            int reparto = triple - minimo;
            int particion = reparto / 2;
            int diferencia = minimo - particion;
            
            if (( diferencia < 3) && (reparto >= 0) ){
                if (diferencia == 2){
                    posiblesorpresa++;
                    //System.err.println(triple + " SORPRESA");
                }
                else{
                    ok++;
                    //System.err.println(triple + " SI");
                }
            }
            else{
                //System.err.println(triple + " NO");
            }
        }
        
        ret = ok + Math.min(sorpresas, posiblesorpresa);
        return ret;
    }
}
public class Dancing {
    public static void main(String[] args) throws Exception{
        Solucion s = new Solucion();
        s.solucion("2 1 1 8 0");
        
        InputStreamReader isr = new InputStreamReader(System.in);
        BufferedReader br = new BufferedReader (isr);
        
        String linea;
        linea = br.readLine();
        int casos = Integer.parseInt(linea);
        
        for (int i=0;i<casos;i++){
            linea = br.readLine();
            int ret = s.solucion(linea);
            System.out.println("Case #"+ (i+1) + ": " + ret );
        }
    }
}
