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

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

/**
 * @author MArunkumar
 *
 */
public class DancingWithTheGooglers {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new FileReader("DancingWithTheGooglersInput.txt"));
		FileWriter fw = new FileWriter("DancingWithTheGooglersOutput.txt");
		int T = Integer.parseInt(br.readLine());
		for(int i=1; i<=T; i++){
			String datas[] = br.readLine().split(" ");
			int N = Integer.parseInt(datas[0]);
			int S = Integer.parseInt(datas[1]);
			int p = Integer.parseInt(datas[2]);
			ArrayList<Dancer> comp = new ArrayList<Dancer>();
			
			for(int j=0; j<N; j++){
				Dancer d = new Dancer(Integer.parseInt(datas[3+j]));
				d.evaluate(p);
				comp.add(d);
			}
			
			int result = 0;
			for(int j=0; j<comp.size(); j++){
				Dancer k = comp.get(j);
				if(k.pass){
					result++;
				}else if(k.passIfSurprised && S>0){
					result++;
					S--;
				}
			}
			
			fw.write("Case #"+i+": "+result+"\n");
		}
		fw.close();
	}

}

class Dancer{
	int ts = 0;
	int s1 = 0;
	int s2 = 0;
	int s3 = 0;
	boolean pass = false;
	boolean passIfSurprised = false;
	
	public Dancer(int ts){
		this.ts = ts;
	}
	
	void evaluate(int p){
		if(ts%3 == 0){
			s1 = s2 = s3 = ts/3;
		}else{
			if(ts%3 == 1){
				s1 = s2 = s3 = ts/3;
				s1++;
			}else{
				s1 = s2 = s3 = ts/3;
				s1++;
				s2++;
			}
		}
		if(s1>=p){
			pass = true;
		}else{
			setPassIfSurprised(p);
		}
	}
	
	void setPassIfSurprised(int p){
		if(s2>0 && s1==s2 &&s1<10){
			s1++;
			s2--;
		}
		if(s1>=p){
			passIfSurprised = true;
		}
	}
}
