import java.io.BufferedWriter;
import java.io.File;
import java.io.FileOutputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Scanner;


public class Dancing_With_the_Googlers {


    /**
     * The first line of the input gives the number of test cases, T.
     *  T test cases follow. 
     *  Each test case consists of a single line containing integers separated by single spaces. 
     *  The first integer will be N, the number of Googlers, and the second integer will be S, the number of surprising triplets of scores. 
     *  The third integer will be p, as described above. Next will be N integers ti: the total points of the Googlers. 
     * @throws IOException
     */
	   public static void main(String[] args) throws IOException {
	        // TODO Auto-generated method stub
			// Reading the input file
			Scanner in = new Scanner(new File("B-large.in"));
			// writting the input file
			FileOutputStream fos = new FileOutputStream("B-large.out");
			PrintStream out = new PrintStream(fos);
	         //Close the output stream
	        int testCase=Integer.parseInt(in.nextLine());
	        for(int i=0;i<testCase;i++) {
	        	out.print("Case #" + (i + 1) + ":\t");
	        	int NoOfGooglers= in.nextInt();
	        	int NoOfSurprisingResults = in.nextInt();
	        	int atLeastP=in.nextInt();
	        	ArrayList<Integer> scores= new ArrayList<Integer>();
        		int BestResults=0;
        		int Surprising=0;
	        	for(int j=0;j<NoOfGooglers;j++)
	        	{
	        		scores.add(in.nextInt());
	        		//System.out.print(scores.get(j));
	        		int modulus=scores.get(j)%3;
	        		int temp = scores.get(j);
	    			switch (modulus) {
					case 0:
						if (((temp / 3) >= atLeastP)) {
							BestResults++;
						} else {
							if (((((temp / 3) + 1) >= atLeastP) && ((temp / 3) >= 1))
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
								
							}
							System.out.println("Case 0"+"itr:"+i+"  surprising:"+temp);
						}
						
						break;
					case 1:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
							continue;
						}
						
						break;
					case 2:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
						} else {
							if (((temp / 3) + 2 >= atLeastP)
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
							}
							System.out.println("Case 2"+"itr:"+i+"  surprising:"+temp);
						}
						break;
					default:
						System.out.println("Error");
					}
	    			
				}// Internal for
				out.println(BestResults);
				// System.out.println(BestResults);
				System.out.println(Surprising);
				BestResults = 0;
			}// for
			in.close();
			out.close();
			fos.close();

	   }
}

package codejam;

import java.io.*;
import java.util.Arrays;

/**
 * @author Dmitry Korolev
 */
public class Task2 {

    public static void main(String[] args) throws IOException {
        Reader inputReader = /*new InputStreamReader(System.in);*/ new FileReader("B-large.in");
        Writer outputWriter = /*new OutputStreamWriter(System.out);*/ new FileWriter("B-large.out");
        BufferedReader in = new BufferedReader(inputReader);
        BufferedWriter out = new BufferedWriter(outputWriter);
        String tStr = in.readLine();
        int tests = Integer.parseInt(tStr);
        for (int i = 0; i < tests; i++) {
            String line = in.readLine();
            String[] strs = line.split("\\s");
            int[] nums = new int[strs.length];
            for (int j = 0; j < strs.length; j++) {
                nums[j] = Integer.parseInt(strs[j]);
            }
            int s = nums[1];
            int p = nums[2];
            int[] t = Arrays.copyOfRange(nums, 3, nums.length);
            out.write("Case #" + (i + 1) + ": " + solve(0, s, p, t) + "\n");
        }
        in.close();
        out.close();

        assert solve(3, 1, 5, 15, 13, 11) == 3;
        assert solve(3, 0, 8, 23, 22, 21) == 2;
        assert solve(2, 1, 1, 8, 0) == 1;
        assert solve(6, 2, 8, 29, 20, 8, 18, 18, 21) == 3;
    }

    private static int solve(int n, int s, int p, int... t) {
        Arrays.sort(t);
        int surprisingCount = 0;
        int result = 0;
        for (int i = t.length - 1; i >= 0; i--) {
            int total = t[i];
            int score = getMaxScore(total);
            if (surprisingCount < s && canBeSurprising(total)) {
                int surprisingScore = getMaxSurprisingScore(total);
                if (score < p && surprisingScore >= p) {
                    surprisingCount++;
                    score = surprisingScore;
                }
            }
            if (score >= p) {
                result++;
            }
        }
        return result;
    }

    private static boolean canBeSurprising(int total) {
        return (total >= 2) && (total <= 28);
    }

    private static int getMaxScore(int total) {
        return (total + 2) / 3;
    }

    private static int getMaxSurprisingScore(int total) {
        return (total + 4) / 3;
    }
}
