package code12.qualification;

import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class B {
	public static String solve(int N, int S, int p, int[] t) {
		
		// 3a 		-> (a, a, a), *(a - 1, a, a + 1)
		// 3a + 1	-> (a, a, a + 1), *(a - 1, a + 1, a + 1)
		// 3a + 2	-> (a, a + 1, a + 1), *(a, a, a + 2)
		
		int numPNoS = 0;
		int numPWithS = 0;
		
		for (int i = 0; i < N; i++) {
			int a = (int)Math.floor(t[i] / 3);
			int r = t[i] % 3;
			
			switch (r) {
			case 0:
				if (a >= p) {
					numPNoS++;
				} else if (a + 1 >= p && a - 1 >= 0) {
					numPWithS++;
				}
				break;
			case 1:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				}
				break;
			case 2:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				} else if (a + 2 >= p) {
					numPWithS++;
				}
				break;
			}
		}
		
		return "" + (numPNoS + Math.min(S, numPWithS));
	}

	public static void main(String[] args) throws Exception {
		// file name
		//String fileName = "Sample";
		//String fileName = "B-small";
		String fileName = "B-large";
		
		// file variable
		File inputFile = new File(fileName + ".in");
		File outputFile = new File(fileName + ".out");
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);

		// problem variable
		int totalCase;
		int N, S, p;
		int[] t;

		// get total case
		totalCase = scanner.nextInt();

		for (int caseIndex = 1; caseIndex <= totalCase; caseIndex++) {
			// get input
			N = scanner.nextInt();
			S = scanner.nextInt();
			p = scanner.nextInt();
			t = new int[N];
			
			for (int i = 0; i < N; i++) {
				t[i] = scanner.nextInt();
			}
			
			String output = "Case #" + caseIndex + ": " + solve(N, S, p, t);
			System.out.println(output);
			writer.write(output + "\n");
		}
		scanner.close();
		writer.close();
	}
}

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 );
        }
    }
}
