/**
 * 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.util.Scanner;


public class DancingWiththeGooglers {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for (int index = 1; index <= T; index++) {
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			int count = 0;
			int matter = 0;
			int notmatter = 0;
			while (N-- > 0) {
				int score = in.nextInt();
				if (score >= 29) { //at least one judge gave 10
					count++;
				} else if (score <= 1) {
					if (score >= p)
						count++;
				} else {
					int div = score / 3;
					int mod = score % 3;
					if (mod == 0) {
						if (div + 1 >= p) {
							if (div + 1 == p)
								matter++;
							else
								notmatter++;
						}
					} else if (mod == 1) {
						if (div + 1 >= p)
							notmatter++;
					} else {
						if (div + 2 >= p) {
							if (div + 2 == p)
								matter++;
							else
								notmatter++;
						}
					}
				}
			}
			count += notmatter + Math.min(S, matter);
			System.out.println("Case #" + index + ": " + count);
		}
	}

}
/*
4
3 1 5 15 13 11
3 0 8 23 22 21
2 1 1 8 0
6 2 8 29 20 8 18 18 21
*/