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.net.*;
import java.io.*;
import java.lang.*;

public class DancingWiththeGooglers {
    public static int highestStable(int x){
    	if(x == 0)
    		return 0;
    	else if(x % 3 == 0)
    		return x/3;
    	else
    		return x/3 + 1;
    }
    public static int highestUnstable(int x){
    	int temp = 0;
    	if(x == 0)
    		temp = 0;
    	else if(x % 3 == 0)
    		temp = x/3 + 1;
    	else if(x % 3 == 1)
    		temp = x/3 + 1;
			else
				temp = x/3 + 2;
			
			if(temp > 10)
				temp = 10;
			return temp;
    }
    public static void main(String[] args) throws IOException {
    String[] spl;
    int counter =1;
    int output;
    int n,s,p;
    int low=0, med=0, high=0;
    int[] nArr = new int[100];
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		String input;
		while((input = in.readLine()) != null){
			//int l = input.length();
			spl = input.split(" ");
			n = Integer.parseInt(spl[0]);
			s = Integer.parseInt(spl[1]);
			p = Integer.parseInt(spl[2]);
			//System.out.println("n:" + n + " s:" + s + " p:" + p  );
			for(int i=0; i<n; i++){
				nArr[i] =  Integer.parseInt(spl[3 + i]); //System.out.println(nArr[i]);
				if (highestStable(nArr[i]) >= p)
					high++;
				else if(highestUnstable(nArr[i]) < p)
					low++;
				else
					med++;
			}
		  //System.out.println("high:" + high + " low:" + low + " med:" + med + '\n' );
			if(s>=med){
				output = med + high; 
				System.out.println("Case #" + counter + ": " + output );
			}
			else{
				output = s + high; 
				System.out.println("Case #" + counter + ": " + output );
			}
			counter++;
			low=0; med=0; high=0;
		}
	}
}
    
