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

import java.util.Iterator;

/**
 * Create an iterator that keeps track of the current index into the Iterable.
 * 
 * Usage:
 * 
 * <code>

	public static void main(String[] args) {
	
		// Iterate over a list:
		ArrayList<String> list = new ArrayList<String>();
		list.add("apple");
		list.add("banana");
		list.add("pear");
		for (IndexedItem<String> it : IndexedItem.iterate(list))
			System.out.println(it.getIndex() + ": " + it.getItem());
			
		// Iterate over an array:
		String[] arr = new String[] {"a", "b", "c"};
		for (IndexedItem<String> it : IndexedItem.iterate(arr))
			System.out.println(it.getIndex() + ": " + it.getItem());
	}

   </code>
 * 
 * @author (c) Luke Hutchison 2010. Covered under the BSD license.
 * 
 * @param <T>
 *            The type of the Iterable.
 */
public class IndexedItem<T> {
	private T item;
	private int index = -1;

	/** Get the current item in the iteration. */
	public T getItem() {
		return item;
	}

	/** Get the index of the current item (zero-indexed). */
	public int getIndex() {
		return index;
	}

	private static class IndexedIterator<U> implements Iterable<IndexedItem<U>>, Iterator<IndexedItem<U>> {

		private final Iterator<U> collectionIter;
		private final IndexedItem<U> currItem = new IndexedItem<U>();

		public IndexedIterator(Iterable<U> collection) {
			this.collectionIter = collection.iterator();
		}

		public IndexedIterator(final U[] array) {
			collectionIter = new Iterator<U>() {
				U[] arr = array;
				IndexedItem<U> it = currItem;

				@Override
				public boolean hasNext() {
					return it.index + 1 < arr.length;
				}

				@Override
				public U next() {
					return arr[it.index + 1];
				}

				@Override
				public void remove() {
					for (int i = it.index + 2; i < arr.length; i++)
						arr[i] = arr[i + 1];
				}
			};
		}

		@Override
		public Iterator<IndexedItem<U>> iterator() {
			return this;
		}

		@Override
		public boolean hasNext() {
			return collectionIter.hasNext();
		}

		@Override
		public IndexedItem<U> next() {
			currItem.item = collectionIter.next();
			currItem.index++;
			return currItem;
		}

		@Override
		public void remove() throws UnsupportedOperationException, IllegalStateException {
			collectionIter.remove();
			currItem.index--;
			currItem.item = null;
		}
	}

	/** Iterate over an Iterable<T> and keep track of the index */ 
	public static <T> Iterable<IndexedItem<T>> iterate(Iterable<T> collection) {
		return new IndexedIterator<T>(collection);
	}

	/** Iterate over an array T[] and keep track of the index */
	public static <T> Iterable<IndexedItem<T>> iterate(T[] array) {
		return new IndexedIterator<T>(array);
	}
}

