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.awt.image.BufferStrategy;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Scanner;


public class DancingGooglers {
	public static void main(String[] args) {
		File file  = new File("C:\\Users\\aadi\\Desktop\\DancingGooglers\\B-small-attempt0.in");
		try{
			FileWriter fstream = new FileWriter("C:\\Users\\aadi\\Desktop\\DancingGooglers\\out.txt");
			BufferedWriter out = new BufferedWriter(fstream);
		    Scanner scanner = new Scanner(file);
		    int numOfCases = Integer.parseInt(scanner.nextLine());
		    for(int i =0 ;i< numOfCases ; i++){
		    	int sCount= 0;
		    	int non_sCount = 0;
		    	String line = scanner.nextLine();
		    	Scanner scanner2 = new Scanner(line);
		    	scanner2.useDelimiter(" ");
		    	int n =  scanner2.nextInt();
		    	int s =  scanner2.nextInt();
		    	int p =  scanner2.nextInt();
		    	while(scanner2.hasNext()){
		    		int tot = scanner2.nextInt();
		    		if(tot>=Math.max((p*3-2), 0)){
		    			non_sCount++;
		    		}else if(tot>=(p + Math.max((p-2),0) + Math.max((p-2),0)) ){
		    			sCount++;
		    		}
		    	}
		    	out.write("Case #"+(i+1)+": ");
		    	if(sCount<s){
	    			//System.out.println(non_sCount+sCount);
	    			out.write(""+(non_sCount+sCount));
	    		}else{
	    			//System.out.println(non_sCount+s);
	    			out.write(""+(non_sCount+s));
	    		}
		    	//System.out.println("");
		    	out.write(System.getProperty("line.separator"));
		    }
		    out.close();
		}catch(FileNotFoundException f){
			f.printStackTrace();
		}catch(Exception e){
			e.printStackTrace();
		}
	}

}
