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();
	}
}

import java.io.*;

public class DancingGooglers {
	private static final String IN_FILE = "B-small.in";
	private static final String OUT_FILE = "B-small_output.txt";
	
	public static void main(String[] args) {
		try {
			BufferedReader br = new BufferedReader(new FileReader(IN_FILE));
			BufferedWriter bw = new BufferedWriter(new FileWriter(OUT_FILE));
			String line = br.readLine();
			final int T_CASES = Integer.parseInt(line);
			
			for (int t = 1; t <= T_CASES; t++) {
				line = br.readLine();
				String parts[] = line.split(" ");
				final int N = Integer.parseInt(parts[0]);	// number of Googlers
				final int S = Integer.parseInt(parts[1]);	// number of surprising triplets of scores
				final int P = Integer.parseInt(parts[2]);	// best result of at least p
				
				int[] totalPoints = new int[N];
				for (int i = 0; i < N; i++) {
					totalPoints[i] = Integer.parseInt(parts[i + 3]);
				}
				
				int result = processCase(N, S, P, totalPoints);
				bw.write("Case #" + t + ": " + result);
				bw.newLine();
			}
			
			bw.close();
			br.close();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}
	
	private static int processCase(int n, int s, int p, int[] totalPoints) {
		int result = 0;
		
		for (int t : totalPoints) {
			switch (p) {
			case 0:
				result++;
				break;
			case 1:
				if (t >= 1) {
					result++;
				}
				break;
			default:
				// p is between 2 to 10
				if (t >= 3 * p - 2) {
					result++;
				} else if (s > 0 && t >= 3 * p - 4) {
					s--;
					result++;
				}
				break;
			}
		}
		
		return result;
	}
	
}
