/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}

package com.code;

import java.io.BufferedReader;
import java.io.Writer;
import java.util.ArrayList;
import java.util.StringTokenizer;

public class DancingWithGooglers 
{
	public static void main(String[] args) 
	{
		ReadWriteInputFile readObj = new ReadWriteInputFile();
		BufferedReader br = null;
		Writer outWriter = null;
		int caseNo = 0,i=0;
		
		String strLine="";
		br = readObj.readInputFile("B-small-attempt0.in");
		outWriter = readObj.writeOutputFile("output.txt");
		if(br!=null || outWriter!=null)
		{
			try
			{
				caseNo = Integer.parseInt(br.readLine());
				while ((strLine = br.readLine()) != null)
				{
					String[] splitStr = strLine.split(" ");
					int N=Integer.parseInt(splitStr[0]),S=Integer.parseInt(splitStr[1]) , p=Integer.parseInt(splitStr[2]);
					int validCount=0;
					ArrayList totalScores = new ArrayList();
					for (int j = 3; j < splitStr.length; j++) 
					{
						totalScores.add(splitStr[j]);
					}
					for(int j=0;j<totalScores.size();j++)
					{
						int q = Integer.parseInt(totalScores.get(j).toString()) / 3;
						int r = Integer.parseInt(totalScores.get(j).toString()) % 3;
						
						if(r==0)
						{
							if(q>=p)
								validCount++;
							else if((q+1)>=p && S!=0 && q!=0)
							{
								validCount++;S--;
							}
						}
						if(r==1)
						{
							if((q+1)>=p)
								validCount++;
						}
						if(r==2)
						{
							if((q+1)>=p)
								validCount++;
							else if((q+2)>=p && S!=0)
							{
								validCount++;S--;
							}
						}
					}
					outWriter.write("Case #"+(++i)+": "+validCount+"\n");
				}
				
			}
			catch (Exception e) 
			{
				e.printStackTrace();
			}
			readObj.closeObjects(outWriter);
		}
	}
}


/*
 
					
					for(int j=0;j<totalScores.size();j++)
					{
						int checkVal = ( (Integer.valueOf(totalScores.get(j).toString())-p)/2 );
						if(checkVal==p || (checkVal+1)==p)
						{
							validCount++;
						}
						else if(checkVal<p && S!=0 )
						{
							validCount++;S--;
						}
					}
 * */
 