/**
 * 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 B {

	void run() {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for (int t=1; t<=T; t++) {
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			int[][] dp = new int[N+1][N+1];
			for (int i=0; i<N; i++) {
				int pt = in.nextInt();
				int sup, nsup;
				boolean supflg = true;
				if (pt >= 29 || pt <= 1) supflg = false;
				/*if (pt >= p*3) {
					nsup = 3;
				} else if (pt >= p*3-1) {
					nsup = 2;
				} else*/ if (pt >= p*3-2) {
					nsup = 1;
				} else {
					nsup = 0;
				}
				/*if (pt >= p*3+2) {
					sup = 3;
				} else if (pt >= p*3-2) {
					sup = 2;
				} else*/ if (pt >= p*3-4) {
					sup = 1;
				} else {
					sup = 0;
				}
				for (int j=0; j<=i; j++) {
					dp[i+1][j] = Math.max(dp[i+1][j], dp[i][j] + nsup);
					if (supflg)
						dp[i+1][j+1] = Math.max(dp[i+1][j+1], dp[i][j] + sup);
				}
			}
			System.out.println("Case #" + t + ": " + dp[N][S]);
		}
	}

	public static void main(String[] args) {
		B obj = new B();
		obj.run();
	}
}
