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

public class B
{
	static int[] a;
	static int[][] dp;
	static int n, s, p;

	public static void main(String args[])
	{
		Scanner scan = new Scanner(System.in);

		int T = scan.nextInt();
		for(int ca=1;ca <= T;ca++)
		{
			n = scan.nextInt();
			s = scan.nextInt();
			p = scan.nextInt();
			a = new int[n];
			for(int i=0;i < n;i++)
				a[i] = scan.nextInt();

			dp = new int[n][s+1];
			for(int i=0;i < n;i++)
				Arrays.fill(dp[i], -1);

			System.out.println("Case #" + ca + ": " + f(0, s));
		}
		
	}


	public static int f(int K, int S)
	{
		if(K == n) return S == 0 ? 0 : -999999;
		if(dp[K][S] != -1) return dp[K][S];

		int rtn = 0;

		boolean[] b = new boolean[4]; //nobeat nosup, nobeat sup, beat nosup, beat sup

		for(int i=0;i <= 10;i++)
		for(int j=0;j <= i;j++)
		{
			if(i+j > a[K]) continue;
			int k = a[K] - (i+j);
			if(k > j) continue;

			if(i-k > 2) continue;

			//System.out.println(i + " " + j + " " + k + " " + a[K]);

			if(i >= p && i-k == 2) b[3] = true;
			if(i >= p && i-k < 2) b[2] = true;
			if(i < p && i-k == 2) b[1] = true;
			if(i < p && i-k < 2) b[0] = true;
		}


		if(S == 0 && !b[0] && !b[2]) return -999999;
		if(S > 0 && b[1]) rtn = Math.max(rtn, f(K+1, S-1));
		if(S > 0 && b[3]) rtn = Math.max(rtn, f(K+1, S-1)+1);
		if(b[0]) rtn = Math.max(rtn, f(K+1, S));
		if(b[2]) rtn = Math.max(rtn, f(K+1, S)+1);

		//System.out.println(K + " " + S + " " + rtn);
		return dp[K][S] = rtn;
		

	}
}