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

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.Scanner;

public class B {
	static int surprise=0;
	static int[] findMin(int[] a)
	{
		for(int i=0;i<a.length-1;i++)
			for(int j=i+1;j<a.length;j++)
			if(a[i]>a[j])
			{
				int t=a[i];
				a[i]=a[j];
				a[j]=t;
			}
		
		return a;
				
	}
	
	static boolean checkTriplet(int a, int b, int c, int maxScore)
	{
		if(Math.abs(a-b)>2 || Math.abs(a-c)>2 || Math.abs(b-c)>2)
			return false;
		if(Math.abs(a-b)==2 || Math.abs(a-c)==2 || Math.abs(b-c)==2)
			if((a>=maxScore || b>=maxScore || c>=maxScore) && surprise>0)
			{
				surprise--;
				return true;
			}
			else return false;
		if(a>=maxScore || b>=maxScore || c>=maxScore)
			return true;
		return false;
		
		
	}
	public static void main(String args[]) throws FileNotFoundException
	{
		Scanner sin=new Scanner(new File("C:\\Users\\DELL\\Desktop\\CodeJam\\B-small-attempt1.in"));
		PrintStream ps=new PrintStream(new File("C:\\Users\\DELL\\Desktop\\CodeJam\\BOut.out"));
		int cases=sin.nextInt();
		for(int i=1;i<=cases;i++)
		{
			int num=sin.nextInt();
			surprise=sin.nextInt();
			int maxScore=sin.nextInt();
			int count=0;
			int[] scores=new int[num];
			for(int j=0;j<num;j++)
				scores[j]=sin.nextInt();
			
			scores=findMin(scores);
			
			for(int j=0;j<scores.length;j++)
			{
				//System.out.println(" for "+scores[j]);
				if(maxScore>scores[j])
					continue;
				int div=scores[j]/3;
				int rem=scores[j]-div;
				if(rem<maxScore)
					continue;
				if(checkTriplet(div,rem/2,rem-rem/2, maxScore))
				{
					//System.out.println("check pass for "+div+" "+rem/2+" "+(rem-rem/2));
					count++;
				}
				else if(checkTriplet(div,maxScore,rem-maxScore,maxScore))
				{
					count++;
				}
			}
			
			ps.println("Case #"+i+": "+count);
			
		}
		ps.close();
	}

}
