/**
 * Created by IntelliJ IDEA.
 * User: Administrator
 * Date: 3/3/12
 * Time: 11:00 AM
 * To change this template use File | Settings | File Templates.
 */

import SRMLib.MathLibrary;
import SRMLib.TestSRMLib;
import com.sun.org.apache.bcel.internal.generic.F2D;

import java.io.*;
import java.util.*;
import java.util.zip.Inflater;

public class SRM {
    public static void main(String[] args) throws IOException {
        //TestSRMLib.run();
        codeJam1.main();

        return;
    }
}
class codeJam1 {
    public static void main() throws IOException {
        String inputPath = "E:\\input.txt";
        String outputPath = "E:\\output.txt";
        BufferedReader input = new BufferedReader(new FileReader(inputPath));
        BufferedWriter output = new BufferedWriter(new FileWriter(outputPath));

        String line;
        line = input.readLine();
        int T = Integer.parseInt(line);
        for (int i = 1; i <= T; ++i) {
            line = input.readLine();
            String[] words = line.split(" ");
            int N = Integer.parseInt(words[0]);
            int S = Integer.parseInt(words[1]);
            int p = Integer.parseInt(words[2]);
            int n = 0;
            int res = 0;

            for (int j = 3; j < words.length; ++j) {
                if (p == 0) {
                    res++;
                    continue;
                }

                int t = Integer.parseInt(words[j]);
                if (p == 1) {
                    if (t > 0)
                        res++;
                    continue;
                }
                if (t >= 3 * p - 2)
                    res++;
                else if (t >= 3 * p - 4)
                    n++;
            }

            res += Math.min(n, S);
            output.write("Case #" + i + ": " + res);
            output.newLine();
        }

        input.close();
        output.close();
    }
}

import java.io.BufferedReader;
import java.io.InputStreamReader;

public class DancingWiththeGooglers {
	BufferedReader reader;
	char [] charInput;
	String [] inputArray;
	int index;
	DancingWiththeGooglers()throws Exception{
		String input=null;
		reader = new BufferedReader(new InputStreamReader(System.in));
		while(reader.ready()){
			if (input==null){
				input =reader.readLine();
			}
			else{
				input =input+ " " + reader.readLine();
			}
		}
		inputArray=input.trim().split(" ");
		index=0;
	}
	String nextInput()throws Exception{
		if(index<inputArray.length){
			int temp=index;
			index++;
			return inputArray[temp];
		}
		else{
			return "\0";
		}
	}
	void start()throws Exception{
		int numCases=Integer.parseInt(nextInput());
		int googlers;
		int surprising;
		int best;
		int total;
		int maxBest=0;
		for(int i=0;i<numCases;i++){
			googlers=Integer.parseInt(nextInput());
			surprising=Integer.parseInt(nextInput());
			best=Integer.parseInt(nextInput());
			for(int j=0;j<googlers;j++){
				total=Integer.parseInt(nextInput());
				if(((double)total)/3>(best-1)){
					maxBest++;
				}
				else if(total%3!=1 && ((double)total)/3>(best-2) && total<28 && total>1){
					if (surprising>0){
						maxBest++;
						surprising--;
					}
				}
			}
			System.out.printf("Case #%d: %d", i+1,maxBest);
			if (i!=numCases-1){
				System.out.println();
			}
			maxBest=0;
		}
	}
}

