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 gcj2012.qual;

import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.Scanner;

public class B {

	final boolean DEBUG = false;
	final String PACKAGE = "gcj2012/qual";
	final String PROBLEM = "B";
	
	boolean noSurprise(int x, int p){
		int y = x-p;
		if(y<0)return false;
		if(1<=p){
			if(y==p-1+p-1)return true;
			if(y==p+p-1)return true;
		}
		if(y==p+p)return true;
		if(p+1<=10){
			if(y==p+p+1)return true;
			if(y==p+1+p+1)return true;
		}
		return false;
	}
	boolean surprise(int x, int p){
		int y = x-p;
		if(y<0)return false;
		if(2<=p){
			if(y==p-2+p)return true;
			if(y==p-2+p-2)return true;
			if(y==p-2+p-1)return true;
		}
		if(p+2<=10){
			if(y==p+2+p)return true;
			if(y==p+2+p+1)return true;
			if(y==p+2+p+2)return true;
		}
		return false;
	}
	
	void run(){
		if(!DEBUG){
			try {
				System.setIn(new FileInputStream(new File("./src/"+PACKAGE+"/"+PROBLEM+"-small.in")));
//				System.setIn(new FileInputStream(new File("./src/"+PACKAGE+"/"+PROBLEM+"-large.in")));
				System.setOut(new PrintStream(new File("./src/"+PACKAGE+"/"+PROBLEM+"-small_out.txt")));
//				System.setOut(new PrintStream(new File("./src/"+PACKAGE+"/"+PROBLEM+"-large_out.txt")));
			} catch (FileNotFoundException e) {
				e.printStackTrace();
			}
		}
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		boolean[][] nosup = new boolean[31][11], sup = new boolean[31][11], ns = new boolean[31][11], s = new boolean[31][11];
		for(int x=0;x<=30;x++)for(int p=0;p<=10;p++){
			nosup[x][p] = noSurprise(x, p); sup[x][p] = surprise(x, p);
		}
		for(int x=0;x<=30;x++)for(int p=0;p<=10;p++){
			boolean f = false;
			for(int k=p;k<=10;k++)f|=nosup[x][k];
			ns[x][p] = f;
			f = false;
			for(int k=p;k<=10;k++)f|=sup[x][k];
			s[x][p] = f;
		}
		for(int CASE=1;CASE<=T;CASE++){
			int N = sc.nextInt(), S = sc.nextInt(), P = sc.nextInt();
			int[] t = new int[N];
			for(int i=0;i<N;i++)t[i]=sc.nextInt();
			boolean[] proc = new boolean[N];
			for(int i=0;i<N&&0<S;i++)if(!ns[t[i]][P]&&s[t[i]][P]){
				S--; proc[i] = true;
			}
			for(int i=0;i<N&&0<S;i++){
				if(proc[i])continue;
				if(s[t[i]][P]){
					proc[i] = true; S--;
				}
			}
			for(int i=0;i<N&&0<S;i++){
				if(proc[i])continue;
				if(s[t[i]][0]){
					proc[i] = true; S--;
				}
			}
			int res = 0;
			for(int i=0;i<N;i++){
				if(proc[i])res+=s[t[i]][P]?1:0;
				else res+=ns[t[i]][P]?1:0;
			}
			System.out.println("Case #"+CASE+": "+res);
		}
	}
	
	public static void main(String[] args) {
		new B().run();
	}
}
