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.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;

public class MaxDancers {

	public static void main(String[] args)throws IOException {

		String fichierentree= "/home/marwen/TÃ©lÃ©chargements/B-small-attempt0.in";
		String fichiersortie= "/home/marwen/Bureau/output.in";

		BufferedWriter	 wr= new BufferedWriter(new FileWriter(fichiersortie));
		DataInputStream	 rd= new DataInputStream(new FileInputStream(fichierentree));		
		
		//Reading number of cases
		String ligne = rd.readLine();
		int cases = Integer.valueOf(ligne);
		
		int k;
		for (k=1;k<=cases;k++) 
		{
			//Reading ligne by ligne
			ligne = rd.readLine();
			ligne=ligne+" ";
			
			// Reading length of the table and filling in it with numbers
			
			int taille = Integer.valueOf(ligne.substring(0, ligne.indexOf(" ")));
			int [] T1= new int [3+taille];
			T1[0]=taille;
			int i,val;
			for (i=1;i<3+taille;i++)
			{
				 ligne=ligne+" ";
				 ligne = ligne.substring(ligne.indexOf(" ") + 1);
				 val = Integer.valueOf(ligne.substring(0, ligne.indexOf(" ")));
				 T1[i]=val;
			}
			
			// End of Reading table from ligne
			
			//Solving the problem for each Line
			
			int s,p,nb,l;
			s=T1[1];
			p=T1[2];
			nb=0;
			l=T1.length;
			for(i=3;i<l;i++)
			{
				if (T1[i]>=p)
				{
				if (T1[i]>=3*p-2) {nb++;}
				else {if ((T1[i]>=3*p-3)||(T1[i]>=3*p-4)){if (s>0){nb++;s--;}}}
				}
			}
			
			//Writing into the output file before moving to the next Line
			wr.write("Case #"+k+": "+nb);
			wr.newLine();
		}	
		
	wr.close();
	rd.close();
	}
}
