/**
 * 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.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;


public class DancingGooglers {
	
	public static int num (int c,int p,int [] g){
		int n = 0;
		for (int i =0;i<g.length;i++){
			if (g[i]>=p+p+p-2){
				n++;
			}
			else if (g[i]>=p+p+p-4){
				if (c>0){
					n++;
					c--;
				}
			}
		}
		return n;
	}
	
	public static void main (String [] args) throws NumberFormatException, IOException{
		BufferedReader br = new BufferedReader(new FileReader("B-small-attempt0.in"));
		int t = Integer.parseInt(br.readLine());
		for (int i =0;i<t;i++){
			StringTokenizer s1 = new StringTokenizer(br.readLine());
			int [] g = new int [Integer.parseInt(s1.nextToken())];
			int c = Integer.parseInt(s1.nextToken());
			int p = Integer.parseInt(s1.nextToken());
			for (int j =0;j<g.length;j++){
				g[j] = Integer.parseInt(s1.nextToken());
			}
			if (p>1){
				System.out.printf("Case #%d: %d\n",i+1,num(c,p,g));
			}
			else {
				int n = 0;
				for (int j =0;j<g.length;j++){
					if (g[j]>=p+p+p-2){
						n++;
					}
				}
				System.out.printf("Case #%d: %d\n",i+1,n);
			}
		}
	}
}
