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

import java.io.BufferedReader;
import java.io.FileReader;

public class MaxScoreDetector {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		String fileName = null;
		if(args.length == 1){
			fileName = args[0];
		}else{
			System.err.println("Requires a command line argument: fileName");
			System.exit(1);
		};
		
		new MaxScoreDetector(fileName);

	}
	
	public MaxScoreDetector(String fileName){
		try{
			BufferedReader in = new BufferedReader(new FileReader(fileName));
			int cases = Integer.parseInt(in.readLine());
			for(int i=0; i<cases; i++){
				String[] line = in.readLine().split(" ");
				int numScores = Integer.parseInt(line[0]);
				int specials = Integer.parseInt(line[1]);
				int min = Integer.parseInt(line[2]);
				int[] scores = new int[numScores];
				for(int j=0; j<scores.length; j++){
					scores[j] = Integer.parseInt(line[j+3]);
				}
				System.out.println("Case #" + (i+1) + ": " + testScores(scores, min, specials));
			}
		}catch(Exception e){
			e.printStackTrace();
		}
		
	}
	
	public int testScores(int[] scores, int min, int specials){
		int over = specials;
		int count = 0;
		for(int i=0; i<scores.length; i++){
			if(scores[i] < min) continue;
			double avg = scores[i]/3.;
			if(avg >= min || Math.ceil(avg)>=min){
				count++;
				continue;
			}
			if(Math.round(avg) == (int)avg + 1 && Math.round(avg) + 1 >= min && over > 0){
				count++;
				over--;
				continue;
			}
			if(avg == (int)avg && avg + 1 >= min && over > 0){
				over--;
				count++;
				continue;
			}
			
		}
		return count;
	}

}
