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

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.util.Scanner;

public class B {

	public static void main(String[] args) {
		int totalCase = 0;
		int supriseCaseNo = 0;
		int googlerNo = 0;
		int p = 0;
		FileInputStream is = null;
		try {
			is = new FileInputStream(args[0]);
			Scanner scan = new Scanner(is);
			totalCase = scan.nextInt();
			for (int i = 0; i < totalCase; i++) {
				googlerNo = scan.nextInt();
				supriseCaseNo = scan.nextInt();
				p = scan.nextInt();
				int[] scores = new int[googlerNo];
				for (int j = 0; j < googlerNo; j++) {
					scores[j] = scan.nextInt();
				}
				solve(i, googlerNo, supriseCaseNo, p, scores);
			}
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} finally {
			try {
				is.close();
			} catch (IOException e) {
				e.printStackTrace();
			}
		}
	}

	private static void solve(int caseNo, int googlerNo, int supriseCaseNo, int p,
			int[] scores) {
		int answer = 0;
		int t = supriseCaseNo;
		for (int i = 0; i < googlerNo; i++) {
			// ½ÏlÌvZ
			int avg = scores[i] / 3;
			int mod = scores[i] % 3;
			int diff = avg - p;
			if (diff <= -3) { 
				continue;
			} else if (diff >= 0) {
				answer++;
			} else if (diff == -1) {
				if (mod == 0) {
					if (t > 0 && p > 1) {
						t--;
						answer++;
					} else {
						continue;
					}
				} else {
					answer++;
				}
			} else if (diff == -2) {
				if (mod == 0 || mod == 1) {
					continue;
				} else if (mod == 2) {
					if (t > 0) {
						t--;
						answer++;
					}
				}
			}
		}
		StringBuilder sb = new StringBuilder();
		sb.append("Case #");
		sb.append(caseNo+1);
		sb.append(": ");
		sb.append(answer);
		System.out.println(sb.toString());
		
	}
}
