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

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.List;

public class Googlers {

	public static void main(String[] args) {
		
		try {
			BufferedReader fileGoo = new BufferedReader(new FileReader("B-large.in"));
			FileWriter miArchivo = new FileWriter("B-large.out");
			
			List<String> listaCasos = new ArrayList<String>();
			String linea;
			while ((linea = fileGoo.readLine()) != null) {
				listaCasos.add(linea);
			}
			int casos = new Integer(listaCasos.get(0));
			
			listaCasos.remove(0);
			int indc=1;
			
			if (casos>0 && casos<=100){
				for (String cadenas: listaCasos) {
					String [] valores= cadenas.split(" ");
					int n= new Integer (valores[0]);
					int s= new Integer (valores[1]);
					int p= new Integer (valores[2]);
					if(s<0 || s>n)
						continue;
					if(p<0 || p>10)
						continue;
					if(n<1 || n>100)  // SmallData
						continue;
					
					int contador = 0;
					int casoEsp=1;
					for (int i = 3; i < valores.length; i++) {
							Integer p1= p-1<0?0:p-1;
							Integer p2= p-2<0?0:p-2;
							Integer valor =new Integer(valores[i]);
							Integer caso1 = p+ p+ p;
							Integer caso2 = p+ p+ p1;
							Integer caso3 = p+ p1+ p1;
							Integer caso4 = p+ p1+ p2;
							Integer caso5 = p+ p2+ p2;
							Integer caso6 = p+ p+ p2;
							
							if(valor<0 || valor>30)
								continue;
							
							if (caso1<valor ||caso2<valor || caso1.equals(valor) || caso2.equals(valor)|| caso3.equals(valor)){
								contador++;
							}
							else if ((s>0 && casoEsp<=s) &&  (caso4.equals(valor) || caso5.equals(valor)|| caso6.equals(valor))){
								contador++;
								casoEsp++;
							}
					}
					miArchivo.write("Case #" + indc + ": " + contador+"\n");
					indc++;
				}	
			}
			
			
			
			miArchivo.flush();
			miArchivo.close();	
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
	
}
