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

import java.util.Scanner;
import java.util.StringTokenizer;

public class DancingWiththeGooglers {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int cases = Integer.parseInt(scan.nextLine());
		for (int i = 0; i < cases; i++) {
			String temp = scan.nextLine();
			StringTokenizer token = new StringTokenizer(temp);
			int N = Integer.parseInt(token.nextToken());
			int S = Integer.parseInt(token.nextToken());
			int P = Integer.parseInt(token.nextToken());
			int[] total = new int[N];
			for (int j = 0; j < total.length; j++) {
				total[j] = Integer.parseInt(token.nextToken());
			}
			System.out.println("Case #" + (i + 1) + ": " + solve(total, S, P));

		}

	}

	private static int solve(int[] total, int s, int p) {
		int ser = s;
		int numberOfWinners = 0;
		for (int i = 0; i < total.length; i++) {
			if (total[i] == 0) {
				if (p == 0)
					numberOfWinners++;
			} else if (total[i] == 1) {
				if (p <= 1)
					numberOfWinners++;
			} else if (total[i] == 2) {
				if (p <= 1)
					numberOfWinners++;
				else if (p == 2 && ser > 0) {
					numberOfWinners++;
					ser--;
				}
			} else {
				int k = total[i] % 3;
				if (k == 0) {
					if (total[i] / 3 >= p)
						numberOfWinners++;
					else if (((total[i] / 3) + 1) >= p && ser > 0) {
						numberOfWinners++;
						ser--;
					}
				} else if (k == 2) {
					int sum = (total[i] / 3) + 1;
					if (sum >= p)
						numberOfWinners++;
					else if ((sum + 1) >= p && ser > 0) {
						numberOfWinners++;
						ser--;
					}

				} else if (k == 1) {
					int sum = (total[i] / 3) + 1;
					if (sum >= p)
						numberOfWinners++;
				}
			}
		}
		return numberOfWinners;

	}
}
