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;
	}
}

package com.gdacarv.codejam;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;

public class ProblemB {

	public static void main(String [ ] args){
		
		try{
			FileInputStream fstream = new FileInputStream("input_problemB.in");
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String input = new String();
			String line;
			while ((line = br.readLine()) != null)
				input += line + '\n';
			System.out.println(input);
			System.out.println(solveProblemB(input));
		}catch (Exception e){//Catch exception if any
			  System.err.println("Error: " + e.getMessage());
		}
		
	}

	private static String solveProblemB(String input) {
		String result = new String();
		String[] lines = input.split("\n"), numbers;
		int len = Integer.parseInt(lines[0]);
		int N, S, p, qt, num;
		for(int i = 1; i <= len; i++){
			result += "Case #" + i + ": ";
			numbers = lines[i].split(" ");
			N = Integer.parseInt(numbers[0]);
			S = Integer.parseInt(numbers[1]);
			p = Integer.parseInt(numbers[2]);
			qt = 0;
			for(int j = 3; j < 3+N; j++){
				num = Integer.parseInt(numbers[j]);
				if(p == 0){
					qt++;
				}else if(p == 1){
					if(num > 0)
						qt++;
				}else if(num / p >= 3 || (num-1) / (p-1) >= 3){
					qt++;
				}else if(S > 0 && num - p - 2*(p-2) >= 0){
					qt++;
					S--;
				}
			}
			result += qt + "\n";
		}
		return result;
	}
}
