import java.io.File;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;


public class B {
	static int[][] memo;
	static int[] nums;
	static int p;
	public static void main(String[] args)throws IOException
	{
		Scanner br=new Scanner(new File("B-small-attempt0.in"));
		PrintWriter out=new PrintWriter(new File("b.out"));
		int cases=br.nextInt();
		for(int c=1;c<=cases;c++)
		{
			int n=br.nextInt(),s=br.nextInt();
			p=br.nextInt();
			nums=new int[n];
			for(int i=0;i<n;i++)
				nums[i]=br.nextInt();
			memo=new int[n][s+1];
			for(int[] a:memo)
				Arrays.fill(a,-1);
			out.printf("Case #%d: %d\n",c,go(0,s));
		}
		out.close();
	}
	public static int go(int index,int s)
	{
		if(index>=nums.length)
			return 0;
		if(memo[index][s]!=-1)
			return memo[index][s];
		int best=0;
		for(int i=0;i<=10;i++)
		{
			int max=i;
			for(int j=0;j<=10;j++)
			{	
				if(Math.abs(i-j)>2)
					continue;
				max=Math.max(i,j);
				thisone:
				for(int k=0;k<=10;k++)
				{
					int ret=0;
					if(Math.abs(i-k)>2||Math.abs(j-k)>2)
						continue;
					max=Math.max(max,k);
					int count=0;
					if(Math.abs(i-k)==2)
						count++;
					if(Math.abs(i-j)==2)
						count++;
					if(Math.abs(j-k)==2)
						count++;
					if(i+j+k==nums[index])
					{
						boolean surp=(count>=1);
						if(surp&&s>0)
						{
							if(max>=p)
								ret++;
							ret+=go(index+1,s-1);
						}
						else if(!surp)
						{
							if(max>=p)
								ret++;
							ret+=go(index+1,s);
						}
						best=Math.max(best,ret);
					}
					else if(i+j+k>nums[index])
						break thisone;
				}
			}
		}
		return memo[index][s]=best;
	}
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;

public class DancingGooglers {

	static BufferedWriter out;
	private static int countMaxScores = 0;

	public static void main(String[] args) {
		System.out.print("Start\n");

		// Prepare the writer
		try {
			FileWriter fstream;
			fstream = new FileWriter("resultfinal.txt");
			out = new BufferedWriter(fstream);
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

		// Prepare the reader
		try {
			BufferedReader reader = new BufferedReader(new FileReader("B-small-attempt4.in"));

			// Read the count of testcases
			int testcases = Integer.parseInt(reader.readLine());

			for (int i = 0; i < testcases; i++) {
				countMaxScores = 0;
				int countwinners = doYourThing(reader.readLine());
				out.write("Case #" + (i + 1) + ": " + countwinners + "\n");
			}

		} catch (FileNotFoundException e1) {
			// TODO Auto-generated catch block
			e1.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

		// Close the output stream
		try {
			out.close();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

	}

	private static Integer doYourThing(String readLine) {
		// System.out.print(readLine +"\n");
		String parts[] = readLine.split(" ");
		int countgooglers = Integer.parseInt(parts[0]);
		int suprising = Integer.parseInt(parts[1]);
		int maxscore = Integer.parseInt(parts[2]);

		ArrayList<Integer> surprisings = new ArrayList<Integer>();
		surprisings.clear();

		// First get all the obvious winners
		for (int i = 0; i < countgooglers; i++) {
			int j = i + 3;
			int score = Integer.parseInt(parts[j]);

			if (score >= maxscore) {
				if (score >= ((maxscore * 3) - 2)) {
					countMaxScores++;
				} else if (score <= ((maxscore * 3) - 5)) {
					// Finding the obvious loser
					System.out.print("Loser " + score + "\n");
				} else {
					surprisings.add(score);
				}
			}
		}
		if (surprisings.size() >= suprising) {
			return countMaxScores + suprising;
		} else {
			return countMaxScores + surprisings.size();
		}

	}
}
