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

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.Arrays;

public class MainProcess {

	/**
	 * @param args
	 */
	
	private Googler[] googlers ;
	
	public MainProcess(File f){
		readFile(f);
	}
	
	private void readFile(File f){
		
		int numCase = 0;
		int numGoogler = 0;
		int numSurprising = 0;
		int p = 0;
		
		try {
			FileReader fr = new FileReader(f);
			BufferedReader br = new BufferedReader(fr);
			
			String str = "";
			
			if( (str = br.readLine())!=null){
				numCase = Integer.parseInt(str);
			}
			
			int count = 0;
			while( count < numCase){
				str = br.readLine();
				String[] substr = str.split(" ");
				
				numGoogler = Integer.parseInt(substr[0]);
				googlers = new Googler[numGoogler];
								
				numSurprising = Integer.parseInt(substr[1]);
				
				p = Integer.parseInt(substr[2]);
				
				for(int i=0 ; i< numGoogler ; i++){
					
					int totalScore = Integer.parseInt(substr[i+3]);
					googlers[i] = new Googler(totalScore);
				}
				
				Arrays.sort(googlers);
				findMaxNum(count ,numSurprising , p);
				
				count++;
			}
			
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
	}
	
	private void findMaxNum(int count , int numSurprising , int p){
		int numMax = 0;
		
		for(int i=0 ; i< googlers.length ; i++){
			if(numSurprising >0){
								
				int maxScore = googlers[i].getMax(true);
				if(maxScore >= p ){
					numMax++;
					numSurprising--;
				}
			}
			else{
				int maxScore = googlers[i].getMax(false);
				if(maxScore >= p ){
					numMax++;
				}
			}
		}
		
		System.out.println("Case #" + (count+1) + ": " + numMax);
	}
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		File f = new File(".\\src\\DancingWithGooglers\\B-small-attempt2.in");
		MainProcess m = new MainProcess(f);
	}

}
