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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.TreeMap;
import java.util.Vector;


public class Dancers
{

	/**
	 * @param args
	 */
	public static void main(String[] args)
	{
		BufferedReader fin;
		try
		{
			BufferedWriter fout = new BufferedWriter(new FileWriter("C:\\Users\\Nick\\Desktop\\CodeJam2012\\BSmall-2-output.txt"));
			fin = new BufferedReader(new FileReader(args[0]));
			int tests = Integer.parseInt(fin.readLine());
			for(int t = 0; t < tests; t++)
			{
				String line = fin.readLine();
				String[] splitLine = line.split(" ");
				int numScores = Integer.parseInt(splitLine[0]);
				int numSurprises = Integer.parseInt(splitLine[1]);
				int targetScore = Integer.parseInt(splitLine[2]);
				int numAboveScore = 0;
				Vector<Integer> scores = new Vector<Integer>();
				for(int s = 0; s < numScores;s++)
					scores.add(Integer.parseInt(splitLine[s + 3]));
				//Fix score of 0 cases
				if(targetScore > 0)
					while(scores.contains(0))
						scores.remove(new Integer(0));
				//Get all possible >= target score without surprises
				for(int s = 0; s < scores.size(); s++)
				{
					if((scores.get(s) % 3 == 0 && scores.get(s) / 3 >= targetScore) || 
							(scores.get(s) % 3 == 1 && scores.get(s) / 3 + 1 >= targetScore) || 
							(scores.get(s) % 3 == 2 && scores.get(s) / 3 + 1 >= targetScore))
					{
						numAboveScore++;
						scores.remove(s);
						s--;
					}
				}
				//Now add in surprises >= target score
				for(int s = 0; s < scores.size() && numSurprises > 0; s++)
				{
					if((scores.get(s) % 3 == 0 && scores.get(s) / 3 + 1 >= targetScore) || 
							(scores.get(s) % 3 == 1 && scores.get(s) / 3 + 1 >= targetScore) || 
							(scores.get(s) % 3 == 2 && scores.get(s) / 3 + 2 >= targetScore))
					{
						numAboveScore++;
						numSurprises--;
					}
				}
				
				//Print output
				fout.write("Case #" + (t+1) + ": " + numAboveScore);
				fout.newLine();
			}
			fout.close();
		}
		catch (Exception e)
		{
			e.printStackTrace();
		}
	}
	
}
