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 com.nolmecolindor.gcj2012.round0;

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

public class Problem_B_0 {
	
	private int solve(final Scanner input) {
		final int N = input.nextInt();
		final int S = input.nextInt();
		final int P = input.nextInt();
		final int[] points = new int[31];
		for (int i = 0; i < N; i++) points[input.nextInt()]++;
//		System.out.println("Point distribution: ");
//		for (int i = 0; i <= 30; i++) System.out.println(points[i] + " dancers got " + i + " points.");

		int remainingSurprises = S;
		
		int result = 0;
		for (int i = 30; i >= 0; i--) {
			if (points[i] == 0) continue;
			final int min;
			final int max;
			switch (i % 3) {
			case 0:
				min = i / 3;
				max = min;
				if (max >= P) { // We reach the limit by default
					result += points[i];
				} else if ((max + 1 == P) && (min > 0) && (max < 10)) { // We can reach the limit with surprises
					final int useSurprises = Math.min(points[i], remainingSurprises);
					remainingSurprises -= useSurprises;
					result += useSurprises;
				} else { // We can not reach the limit anyway
					// We are not interested
				}
				break;
			case 1:
				max = (i - 1) / 3 + 1;
				if (max >= P) result += points[i];
				break;
			case 2:
				min = (i - 2) / 3;
				max = min + 1;
				if (max >= P) { // We reach the limit by default
					result += points[i];
				} else if ((max + 1 == P) && (max < 10)) { // We can reach the limit with surprises
					final int useSurprises = Math.min(points[i], remainingSurprises);
					remainingSurprises -= useSurprises;
					result += useSurprises;
				} else { // We can not reach the limit anyway
					// We are not interested
				}
				break;
			}
			
		}
		return result;
	}
	
	
	private void solveAll(final Scanner input) throws NumberFormatException, IOException {
		final int cases = input.nextInt();
		input.nextLine();
		for (int caseNum = 1; caseNum <= cases; caseNum++) {
			System.out.println("Case #" + caseNum + ": " + solve(input));
		}
	}
	
	public static void main(final String[] args) {
		try {
			final Scanner input = new Scanner(((args.length == 2) && args[0].equals("--input")) ? new FileInputStream(args[1]) : System.in);
			new Problem_B_0().solveAll(input);
		} catch (NumberFormatException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

}
