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

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.StringTokenizer;

/**
 * @author Brijesh Mistry
 *
 */
public class GooglerDance {

	
	
	public static void main(String[] args) {
		
		try{
			FileInputStream fstream = new FileInputStream("b1.in");
		  
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String fileline;		
			
			//Read File Line By Line
			int j =0 ;
			String strTestcases ;
			int iTestcases = 0;
			
			//Read no of testcases			
			if(((strTestcases = br.readLine()) != null)){
				System.out.println("Test cases:"+strTestcases);
				iTestcases = Integer.parseInt(strTestcases);
			}
			//int noofGoogler = 0;
			//int noOfSurprises = 0;
			//int noOfSurprisesRemaining = 0;
			//int limitScore = 0;
			//int minscore = 0;
			//int totalWinner = 0;
			for(int k=1;k<=iTestcases;k++){
			//for(int k=1;k<=3;k++){
				int noofGoogler = 0;
				int noOfSurprises = 0;
				int noOfSurprisesRemaining = 0;
				int limitScore = 0;
				int minscore = 0;
				int totalWinner = 0;
				if((fileline = br.readLine()) != null){					
					//System.out.println ("line #"+(k)+" "+fileline);
					StringTokenizer st = new StringTokenizer(fileline, " "); 
					noofGoogler = Integer.parseInt(st.nextToken());
					noOfSurprises = Integer.parseInt(st.nextToken());
					limitScore = Integer.parseInt(st.nextToken());
					//System.out.println(k+"Parameters fetched:"+noofGoogler+" : "+noOfSurprises+ " : "+limitScore);
					
					//Logic that gives the no of players
					//store Max scores into ArrayList
					ArrayList<Integer> maxScores = new ArrayList<Integer>();
					ArrayList<Integer> secondscore =new ArrayList<Integer>();
					for(int i=0;i<noofGoogler;i++){
						maxScores.add(Integer.parseInt(st.nextToken()));
					}					
					//Max scores we have into List
					
					
					//NOW Check for normal score
					minscore = (limitScore-1)*2+limitScore;
					for(int score:maxScores){
						if(score>=minscore && score >= limitScore){
							totalWinner +=1;							
						}else{
							//System.out.println("adding score: case :"+k+":"+score);
							secondscore.add(score);
						}
					}
					
					noOfSurprisesRemaining = noOfSurprises; 
					if(noOfSurprisesRemaining>0){						
						minscore = (limitScore-2)*2+limitScore;
						//System.out.println("min score"+minscore);
						
						for(int score:secondscore){
							if(score>=minscore && noOfSurprisesRemaining>0 && score >= limitScore){
								//ystem.out.println("for Surprises score: case :"+k+":" +score);
								totalWinner +=1;
								noOfSurprisesRemaining --;								
							}
						}
					}
					
				
					
					System.out.println("Case #"+k+": "+totalWinner);
					
				}
			}
			
		  //Close the input stream
		  in.close();
		 }catch (Exception e){//Catch exception if any
			  e.printStackTrace();
		 }

	}

}
