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

import java.io.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.StringTokenizer;

public class B {
	public static void main(String[] args) throws IOException {
		for (int i=0; i<=10; i++) {
			System.out.println(Math.max((i-2)+(i-2)+i,i));
		}
		
		
		// Use BufferedReader rather than RandomAccessFile; it's much faster
		BufferedReader f = new BufferedReader(new FileReader("B-small-attempt4.in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("B-small-attempt4.out")));

		HashMap<Integer, ArrayList<String>> debug = new HashMap<Integer, ArrayList<String>>();

		int cases = Integer.parseInt(f.readLine());
		for (int zz = 1; zz <= cases; zz++) {
			String x = f.readLine();
			StringTokenizer st = new StringTokenizer(x);
			int n = Integer.parseInt(st.nextToken());
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());  //At least p for BEST score.
			int[] points = new int[n];
			int ans = 0;

			// Assume p = 5
			int magicNum = Math.max((p - 2) + (p - 2) + p,p); // 3 3 5 or 3 4 5
			// magicNum and MagicNum+1 are always be surprising

			// 3 5 5 or 4 4 5
			// magicNum+2 may be surprising or not.

			//p=0 -2 -2 0
			//p=1 -1 -1 1
			//p=2  0  0 2
			//p=3  1  1 3
			//p=4  2  2 4 
			
			for (int xx = 0; xx < n; xx++) {
				points[xx] = Integer.parseInt(st.nextToken());
				
				if (p==0 || p==1) {
					if (points[xx]>=p)
						ans++;
					continue;
				}
				
				if (s > 0 && (points[xx] == magicNum || points[xx] == magicNum + 1)) {
					s--;
					ans++;
				} else if (points[xx] >= magicNum + 2) {
					ans++;
				}
			}
			out.println("Case #" + zz + ": " + ans);

		}

		out.close(); // close the output file
		System.exit(0); // don't omit this!
	}

}