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 prob2;

import com.bertramtruong.utils.BT;
import com.bertramtruong.utils.DataReader;

/**
 *
 * @author Bertram
 */
public class Prob2 {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        DataReader dr = new DataReader("input.in");

        try {
            int nLines = dr.readInt();
            for (int i = 0; i < nLines; i++) {
                //BT.db("==================== case ", (i + 1), " =================");
                System.out.print("Case #" + (i + 1) + ": ");
                int nGooglers = dr.readInt();
                int nSurprising = dr.readInt();
                int bestRes = dr.readInt();

                //BT.db("nGooglers: ", nGooglers);
                //BT.db("nSurprising: ", nSurprising);
                //BT.db("bestRes: ", bestRes);

                int np = 0;
                for (int j = 0; j < nGooglers; j++) {
                    // triplets, take a number divide by 3,
                    int totalScore = dr.readInt();
                    int triplet = totalScore / 3;
                    if (triplet >= bestRes) {
                        //BT.db("bestres: ", triplet);
                        np++;
                    } else {
                        /**
                         * double remaindar = triplet % 3; // can we do it with
                         * 1? if (triplet + 1 >= bestRes) { if (remaindar == 0
                         * && nSurprising == 0) { } else { nSurprising--; np++;
                         * } }
                         *
                         * if (triplet + 2 >= bestRes) { BT.db("triplet: ",
                         * triplet); // can you do it with 1? if (triplet + 1 >=
                         * bestRes) { // good np++; } else { if (nSurprising >
                         * 0) { //BT.db("after: ", triplet + 2); nSurprising--;
                         * triplet += 2; } } }
                         *
                         * if (triplet >= bestRes) { np++; }
                         */
                        int rem = totalScore % 3;
                        if (triplet + 1 >= bestRes && rem >= 1) {
                            np++;
                        } else {
                            if (totalScore != 0) {
                                switch (rem) {
                                    case 0:
                                        if (nSurprising > 0 && triplet + 1 >= bestRes) {
                                            triplet++;
                                            nSurprising--;
                                        }
                                        break;
                                    case 1:
                                        triplet++;
                                        break;
                                    case 2:
                                        if (nSurprising > 0 && triplet + 2 >= bestRes) {
                                            triplet += 2;
                                            nSurprising--;
                                        }
                                        break;
                                }

                                if (triplet >= bestRes) {
                                    np++;
                                }
                            }
                        }
                    }
                }
                System.out.print(np);
                System.out.println();
            }
        } catch (Exception x) {
        }
    }
}
