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.irabin.google.codejam.problem2;

import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Scanner;

public class DanceWithGoogler {

	class Score {

		private Long score;
		private Long firstJury;
		private Long secondJury;
		private Long thirdJury;

		public Score() {
		}

		public Long getScore() {
			return score;
		}

		public void setScore(Long score) {
			this.score = score;
		}

		public Long getFirstJury() {
			return firstJury;
		}

		public void setFirstJury(Long firstJury) {
			this.firstJury = firstJury;
		}

		public Long getSecondJury() {
			return secondJury;
		}

		public void setSecondJury(Long secondJury) {
			this.secondJury = secondJury;
		}

		public Long getThirdJury() {
			return thirdJury;
		}

		public void setThirdJury(Long thirdJury) {
			this.thirdJury = thirdJury;
		}

		public boolean isSuprisedResult() {
			boolean suprise = false;
			if (Math.abs(firstJury - secondJury) >= 2
					|| Math.abs(firstJury - thirdJury) >= 2
					|| Math.abs(secondJury - thirdJury) >= 2) {
				suprise = true;
			}
			return suprise;
		}

	}

	private Scanner scanner;
	private PrintWriter writer;

	public DanceWithGoogler(InputStream in, OutputStream os) {
		scanner = new Scanner(in);
		writer = new PrintWriter(os);
	}

	public void solve() {

		int n = Integer.parseInt(scanner.nextLine());

		for (int i = 1; i <= n; i++) {
			writer.print("Case #" + i + ": ");

			int N = scanner.nextInt();
			int S = scanner.nextInt();
			int p = scanner.nextInt();

			String output = "";
			int totalBetterThanP = 0;
			int foundSuprise = 0;

			Score[] scores = new Score[N];
			for (int j = 0; j < N; j++) {
				scores[j] = new Score();
				scores[j].setScore(scanner.nextLong());
			}

			// sort ascending
			for (int j = 0; j < N; j++) {
				for (int k = j + 1; k < N; k++) {
					if (scores[k].getScore() > scores[j].getScore()) {
						Score tempScore = scores[k];
						scores[k] = scores[j];
						scores[j] = tempScore;
					}
				}
			}

			for (int j = 1; j <= N; j++) {

				Long equalScore = scores[j - 1].getScore() / 3;

				Long firstJury = equalScore;
				Long secondJury = equalScore;
				Long thirdJury = equalScore;

				Long dividen = scores[j - 1].getScore() % 3;
				while (dividen > 0) {
					firstJury = firstJury + 1;
					dividen = dividen - 1;
					if (dividen > 0) {
						secondJury = secondJury + 1;
						dividen = dividen - 1;
					}
					if (dividen > 0) {
						thirdJury = thirdJury + 1;
						dividen = dividen - 1;
					}
				}

				scores[j - 1].setFirstJury(firstJury);
				scores[j - 1].setSecondJury(secondJury);
				scores[j - 1].setThirdJury(thirdJury);
			}

			for (int j = 1; j <= N; j++) {

				if (scores[j - 1].isSuprisedResult()) {
					foundSuprise = foundSuprise + 1;
				} else {
					if (foundSuprise < S && ((scores[j-1].getFirstJury()<p && scores[j-1].getSecondJury()<p && scores[j-1].getThirdJury()<p)||(j<N && scores[j].getScore()<5))) {
						scores[j - 1].setFirstJury(scores[j-1].getFirstJury() - 1);
						if (scores[j - 1].getSecondJury() < p) {
							scores[j - 1].setSecondJury(scores[j - 1].getSecondJury() + 1);
						} else if (scores[j - 1].getThirdJury() < p) {
							scores[j - 1].setThirdJury(scores[j - 1].getThirdJury() + 1);
						} else {
							scores[j - 1].setSecondJury(scores[j - 1].getSecondJury() + 1);
						}
						foundSuprise = foundSuprise + 1;
					}
				}

				if (scores[j-1].getFirstJury() >= p || scores[j-1].getSecondJury() >= p || scores[j-1].getThirdJury() >= p) {
					totalBetterThanP = totalBetterThanP + 1;
				}

			}
			output = String.valueOf(totalBetterThanP);

			writer.println(output);
			writer.flush();
		}
		writer.close();

	}

	public static void main(String args[]) {

		InputStream input = null;
		input = DanceWithGoogler.class.getResourceAsStream(args[0]);

		OutputStream output = null;
		try {
			output = new FileOutputStream(args[1]);
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}

		DanceWithGoogler practise1 = new DanceWithGoogler(input, output);
		practise1.solve();
	}
}
