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

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class CodeJam_B_Small {
	public static void main(String[] args) throws IOException {
		String strLine;
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		CodeJam_B_Small me = new CodeJam_B_Small();

		me.init();

		strLine = br.readLine();
		int T = Integer.parseInt(strLine);
		String[] as;
		int n, s, p, y;
		int t[];
		for (int x = 1; x <= T; x++) {
			strLine = br.readLine();
			as = strLine.split(" ");
			n = Integer.parseInt(as[0]);
			s = Integer.parseInt(as[1]);
			p = Integer.parseInt(as[2]);
			t = new int[n];
			for (int i = 0; i < n; i++) {
				t[i] = Integer.parseInt(as[i + 3]);
			}
			y = me.get_max_over_p(n, s, p, t);
			System.out.println("Case #" + x + ": " + y);
		}
	}

	private int[][] total2best_scores = new int[31][2]; // total 0 ~ 30
	private static final int STANDARD = 0; // standard
	private static final int SURPRISING = 1; // surprising

	public void init() {
		for (int i = 0; i < total2best_scores.length; i++) {
			total2best_scores[i][STANDARD] = (i + 2) / 3;
			total2best_scores[i][SURPRISING] = (i + 4) / 3;
			if (total2best_scores[i][SURPRISING] == 1) {
				total2best_scores[i][SURPRISING] = 0;
			}
		}
	}

	public int get_max_over_p(int n, int s, int p, int[] t) {
		int y = 0;
		for (int i = 0; i < n; i++) {
			if (total2best_scores[t[i]][STANDARD] >= p) {
				y++;
			} else if (total2best_scores[t[i]][SURPRISING] == p) {
				if (s > 0) {
					s--;
					y++;
				}
			}
		}
		return y;
	}
}
