/**
 * 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();
    }
}

package qualification;

import java.util.Scanner;

public class B {

	public static void main(String[] args) {
		try {
			Scanner scanner = new Scanner(System.in);
			int lp = scanner.nextInt();
			int c = 0;
			for (int loop = 0; loop < lp; loop++) {
				int N = scanner.nextInt();
				int S = scanner.nextInt();
				int p = scanner.nextInt();
				int ans = 0;
				for (int j = 0; j < N; j++) {
					int t = scanner.nextInt();
					if (t < 2) {
						if (p <= t) {
							ans++;
						}
					}
					if (t == 2) {
						if (p < t) {
							ans++;
						}
						if (p == t && S > 0) {
							ans++;
							S--;
						}
					}
					if (t > 2) {
						if (t / 3 >= p) {
							ans++;
						} else {
							switch (t % 3) {
							case 0:
								if (t / 3 + 1 == p && S > 0) {
									S--;
									ans++;
								}
								break;
							case 1:
								if (t / 3 + 1 == p) {
									ans++;
								}
								break;
							case 2:
								if (t / 3 + 1 == p) {
									ans++;
								} else if (t / 3 + 2 == p && S > 0) {
									ans++;
									S--;
								}
								break;
							}
						}
					}
				}
				c++;
				System.out.println("Case #" + c + ": " + ans);
			}
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

}
