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


public class DWG {
	public static void main(String[] args) {
		Integer caseNum = 0;
		/*if(args.length == 0) {
			return;
		}
		caseNum = Integer.parseInt(args[0]);*/
		ArrayList<String> argList = new ArrayList<String>();
		
		String line=null;
		File inputFile = new File("DWGData.txt");
		BufferedReader reader;
		try {
			reader = new BufferedReader(new FileReader(inputFile));
			while ((line=reader.readLine()) != null) {
				argList.add(line);
			}
		} catch (Exception e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
		caseNum = Integer.parseInt(argList.get(0));
		
		for(int caseIndex=0; caseIndex < caseNum.intValue(); caseIndex++) {
			String input = argList.get(caseIndex+1);
			System.out.println("Case #" + (caseIndex+1) + ": " + countGooglers(input));
		}
	}
	
	private static int countGooglers(String input) {
		int numOfWiners = 0;
		String[] inputData = input.split(" ");
		if(inputData.length >=4) {
			int numOfGooglers = Integer.parseInt(inputData[0]);
			int numOfSurprise = Integer.parseInt(inputData[1]);
			int score = Integer.parseInt(inputData[2]);
			
			int minWithSurprise = ((score > 2) ? (score-2) : 0)*2 + score;
			int minWithoutSurprise = ((score > 1) ? (score-1) : 0)*2 + score;
			
			if((inputData.length-3) == numOfGooglers) {
				int[] scoreOfGooglers = new int[numOfGooglers];
				for(int i=0; i < numOfGooglers; i++) {
					scoreOfGooglers[i] = Integer.parseInt(inputData[i+3]);
					if(scoreOfGooglers[i] >= minWithoutSurprise) {
						numOfWiners++;
					}else if(scoreOfGooglers[i] >= minWithSurprise) {
						if(numOfSurprise > 0) {
							numOfWiners++;
							numOfSurprise--;
						}
					}
				}
				
			}
		}
		
		return numOfWiners;
	}
}
