package com.silverduner.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashMap;

public class Dancing {
	public static void main(String[] args) throws Exception {
		File input = new File("B-small-attempt0.in");
		BufferedReader in = new BufferedReader(new FileReader(input));

		File output = new File("1.out");
		BufferedWriter out = new BufferedWriter(new FileWriter(output));

		// parse input
		int N = Integer.parseInt(in.readLine());
		for(int i=0;i<N;i++) {
			String str = in.readLine();
			out.write("Case #"+(i+1)+": ");
			System.out.println("-------");
			String[] words = str.split(" ");
			int n = Integer.parseInt(words[0]);
			int suprise = Integer.parseInt(words[1]);
			int threshold = Integer.parseInt(words[2]);
			int[] scores = new int[n];
			for(int j=0;j<n;j++) {
				scores[j] = Integer.parseInt(words[3+j]);
			}
			int count = 0;
			for(int score : scores) {
				int a,b,c;
				boolean find = false;
				boolean sfind = false;
				for(a = 10; a>=0 && !find; a--) {
					if(3*a-4>score)
						continue;
					for(b = a; b>=0 && b >=a-2 && !find; b--) {
						for(c = b; c>=0 && c >=b-2 && c >=a-2 && !find; c--) {
							System.out.println(a+","+b+","+c);
							if(a+b+c==score) {
								if(a >= threshold) {
									if(a-c <= 1){
										count++;
										find = true;
										System.out.println("find!");
									}
									else if(a-c == 2){
										sfind = true;
										System.out.println("suprise!");
									}
								}
							}
							
						}
					}
				}
				if(!find && sfind && suprise > 0)
				{
					count++;
					suprise --;
				}
			}
			int maxCount = count;
			out.write(maxCount+"\n");
		}
		out.flush();
		out.close();
		in.close();
	}
}

package problem_b;

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

public class ProblemB {

	public static void main(String[] args) {
		try {
			processFile("/Users/ibogomolov/Desktop/B-small-attempt0.in", "/Users/ibogomolov/Desktop/out.txt");
		} catch (IOException e) {
			e.printStackTrace();
		}
	}



	private static int process(int n, int s, int p, int[] total) {
		int res = 0;
		for (int i = 0; i < n; i++) {
			int div = total[i]/3;
			int mod = total[i]%3;
			if (div >= p || (div + 1 >= p && mod >= 1)) {
				res++;
			} else if ((div + 2 >= p && mod == 2 && s > 0) || (div + 1 >= p && div >= 1 && mod == 0 && s > 0)) {
				res++;
				s--;
			}
		}
		return res;
	}

	public static void processFile(String in, String out) throws IOException {
		Scanner scanner = new Scanner(new File(in));
		BufferedWriter writer = new BufferedWriter(new FileWriter(out));
		int cases = scanner.nextInt();
		for (int i = 1; i < cases+1; i++) {
			int n = scanner.nextInt();
			int s = scanner.nextInt();
			int p = scanner.nextInt();
			int[] array = new int[n];
			for (int j = 0; j < n; j++) {
				array[j] = scanner.nextInt();
			}
			writer.write("Case #" + i + ": " + process(n, s, p, array) + "\n");
		}

		scanner.close();
		writer.close();
	}
}
