/**
 * 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.File;
import java.util.*;

public class ProblemB {

	public static void main(String[] args) throws Exception {

		// Scanner sc = new Scanner(new File("C:\\B-small-attempt0.in"));
		Scanner sc = new Scanner(System.in);
		int cases = Integer.parseInt(sc.nextLine().trim());
		for (int i = 0; i < cases; i++) {
			int n = sc.nextInt();
			int s = sc.nextInt();
			int p = sc.nextInt();
			int[] val = new int[n];

			for (int j = 0; j < n; j++) {
				val[j] = sc.nextInt();
			}
			System.out.println("Case #" + (i + 1) + ": " + solve(s, p, val));
		}
	}

	private static int solve(int s, int p, int[] val) {

		int ret = 0;

		for (int v : val) {
			int x1, x2 = 0;

			
			if (v < 2) {
				x1 = v;
			} else if (v > 28) {
				x1 = 10;
			} else if (v % 3 == 1) {
				x1 = (v + 2) / 3;
			} else if (v % 3 == 0) {
				x1 = v / 3;
				if ((x1 == p - 1) && (s > 0)) {
					s--;
					x1++;
				}

			} else {
				x1 = (v + 1) / 3;
				if ((x1 == p - 1) && (s > 0)) {
					s--;
					x1++;
				}
			}
			if (x1 >= p)
				ret++;
		}

		return ret;

	}

}
