package code12.qualification;

import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class B {
	public static String solve(int N, int S, int p, int[] t) {
		
		// 3a 		-> (a, a, a), *(a - 1, a, a + 1)
		// 3a + 1	-> (a, a, a + 1), *(a - 1, a + 1, a + 1)
		// 3a + 2	-> (a, a + 1, a + 1), *(a, a, a + 2)
		
		int numPNoS = 0;
		int numPWithS = 0;
		
		for (int i = 0; i < N; i++) {
			int a = (int)Math.floor(t[i] / 3);
			int r = t[i] % 3;
			
			switch (r) {
			case 0:
				if (a >= p) {
					numPNoS++;
				} else if (a + 1 >= p && a - 1 >= 0) {
					numPWithS++;
				}
				break;
			case 1:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				}
				break;
			case 2:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				} else if (a + 2 >= p) {
					numPWithS++;
				}
				break;
			}
		}
		
		return "" + (numPNoS + Math.min(S, numPWithS));
	}

	public static void main(String[] args) throws Exception {
		// file name
		//String fileName = "Sample";
		//String fileName = "B-small";
		String fileName = "B-large";
		
		// file variable
		File inputFile = new File(fileName + ".in");
		File outputFile = new File(fileName + ".out");
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);

		// problem variable
		int totalCase;
		int N, S, p;
		int[] t;

		// get total case
		totalCase = scanner.nextInt();

		for (int caseIndex = 1; caseIndex <= totalCase; caseIndex++) {
			// get input
			N = scanner.nextInt();
			S = scanner.nextInt();
			p = scanner.nextInt();
			t = new int[N];
			
			for (int i = 0; i < N; i++) {
				t[i] = scanner.nextInt();
			}
			
			String output = "Case #" + caseIndex + ": " + solve(N, S, p, t);
			System.out.println(output);
			writer.write(output + "\n");
		}
		scanner.close();
		writer.close();
	}
}

package y2012;

import java.io.*;
import java.util.Arrays;

public class Glob {

  /**
  * Fetch the entire contents of a text file, and return it in a String.
  * This style of implementation does not throw Exceptions to the caller.
  *
  * @param aFile is a file which already exists and can be read.
  */
  static public void IOwork() {
    //...checks on aFile are elided
    try {
      //use buffering, reading one line at a time
      //FileReader always assumes default encoding is OK!
      BufferedReader input =  new BufferedReader(new FileReader(new File("F:\\file.in")));
      Writer output = new BufferedWriter(new FileWriter(new File("F:\\file.out")));
      try {
        String line = null; //not declared within while loop
        /*
        * readLine is a bit quirky :
        * it returns the content of a line MINUS the newline.
        * it returns null only for the END of the stream.
        * it returns an empty String if two newlines appear in a row.
        */
        line = input.readLine();
        int NoOfCases = Integer.parseInt(line);
        for (int i = 0; i < NoOfCases; i++) {
        	line = input.readLine();
        	String[] v1 = line.split(" ");
        	int t = Integer.parseInt(v1[0]);
        	int s = Integer.parseInt(v1[1]);
        	int p = Integer.parseInt(v1[2]);
        	int answer = 0;
        	System.out.println(t);
        	System.out.println(s);
        	System.out.println(p);
        	for (int j = 3; j < v1.length; j++) {
        		int temp = Integer.parseInt(v1[j]);
        		if (temp > 0) {
        		switch (temp%3) {
        		case 0 : {
        			if (temp/3 >= p) answer++;
        			else if (temp/3+1 == p && s > 0) {
        				answer++;
        				s--;
        			}
        			break;
        		}
        		case 1 : {
        			if (temp/3+1 >= p) answer++;  	
        			break;
        		}
        		case 2 : {
        			if (temp/3+1 >= p) answer++;
        			else if (temp/3+2 == p && s > 0) {
        				answer++;
        				s--;
        			}
        			break;
        		}
        		}
        		}
        		else if (p == 0) answer++;
        	}
        	output.write("Case #"+(i+1)+": "+answer+"\n");
        }
      }
      finally {
        input.close();
        output.close();
      }
    }
    catch (IOException ex){
      ex.printStackTrace();
    }
  }
  
  private static int rope(int[][] lines) {
	  int ans = 0;
	  for (int i = 0; i < lines.length-1; i++){
		  for (int j = i+1; j < lines.length; j++) {
			  if ((lines[i][0] > lines[j][0] && lines[i][1] < lines[j][1])||(lines[i][0] < lines[j][0] && lines[i][1] > lines[j][1]))
				  ans++;
		  }
	  }
	return ans;
  }
  
  public static void main (String[] aArguments) throws IOException {
	  IOwork();
	  }
}