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 gcj2012.Pre;

import java.util.Scanner;

public class B {

	static Scanner sc = new Scanner(System.in);
	public static void main(String[] a){
				
		long numCases = Long.parseLong(sc.nextLine());
		for(long kase = 0 ; kase < numCases ; kase++){
			String[] ss = sc.nextLine().split(" ");
			int n = Integer.parseInt(ss[0]);
			int s = Integer.parseInt(ss[1]);
			int p = Integer.parseInt(ss[2]);
			int[] scores= new int[n];
			for(int i = 0 ; i < n ; i++)
				scores[i] = Integer.parseInt(ss[3+i]);			
			
			int ret = 0;
			if(p == 0){
				ret = n;
			}else if(p == 1){
				for(Integer i : scores){
					if(i > 0){
						ret++;
					}
				}				
			}else{
				int canCntSurNotNeed = 0;
				int canCntSurNeed = 0;
				int canSurOnly = 0;
				int canCntOnly = 0;
				for(int i = 0 ; i < n ; i++){
					if(scores[i] > 28){
						canCntOnly++;
					}else if(scores[i] >= p+p-1+p-1){
						canCntSurNotNeed++;
					}else if(scores[i] >= p+p-2+p-2){	
						canCntSurNeed++;
					}else if(scores[i] >= 2){
						canSurOnly++;
					}
				}
				if(s <= canCntSurNeed){
					ret = canCntOnly + canCntSurNotNeed + s;
				}else{
					ret = canCntOnly + canCntSurNotNeed + canCntSurNeed;
				}
			}
			
			System.out.println("Case #" + (kase+1) + ": " + ret);
		}
	}
		
}
