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.FileReader;
import java.util.ArrayList;


public class Run2
{
	public static void main(String[] args)
	{
		String path = "files/B-small-attempt1.in";
		
		int T = 0;
		ArrayList<ArrayList<Integer>> googlers = new ArrayList<ArrayList<Integer>>();
		ArrayList<Integer> surprisings = new ArrayList<Integer>();
		ArrayList<Integer> leasts = new ArrayList<Integer>();
		
		try
		{
			boolean isFirstLine = true;
			
			FileReader FR = new FileReader(path);
			BufferedReader BR = new BufferedReader(FR);
			String str = "";
			
			while((str=BR.readLine())!=null)
			{
				if (isFirstLine)
				{
					T = Integer.parseInt(str);
					isFirstLine = false;
				}
				else
				{
					String[] temp = str.split(" ");
					
					surprisings.add(Integer.parseInt(temp[1]));
					leasts.add(Integer.parseInt(temp[2]));
					
					ArrayList<Integer> score = new ArrayList<Integer>();
					for(int i = 3; i < temp.length; i++)
					{
						score.add(Integer.parseInt(temp[i]));
					}
					googlers.add(score);
				}
			}
		}
		catch (Exception e)
		{
			e.printStackTrace();
		}
		
		for(int i = 0; i < T; i++)
		{
			ArrayList<Integer> googler = googlers.get(i);
			int surprising = surprisings.get(i);
			int least = leasts.get(i);
			int number = 0;
			
			int dontSurprising = 0;
			int isSurprising = 0;
			for(int j = 0; j < googler.size(); j++)
			{
				int score = googler.get(j);
				
				int surprisingBounds = least+(least-2)*2;
				int dontSurprisingBounds = least+(least-1)*2;
				if (least < 2)
				{
					surprisingBounds = least;
					dontSurprisingBounds = least;
				}
				if (score >= surprisingBounds && score < dontSurprisingBounds)
				{
					isSurprising++;
				}
				else if (score >= dontSurprisingBounds)
				{
					dontSurprising++;
				}
			}
			number = dontSurprising+isSurprising+((surprising-isSurprising)>=0?0:(surprising-isSurprising));
			System.out.println("Case #"+(i+1)+": "+number);
		}
	}
}