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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;

public class Googler3 {

	
	public static void main(String[] args) {
		try
		{
			//BufferedReader br = new BufferedReader(new FileReader("/Users/Sush/Documents/workspace1/CJ/src/files/Input.txt"));
			BufferedReader br = new BufferedReader(new FileReader("/Users/Sush/Downloads/B-small-attempt0.in.txt"));
			String line;
			StringBuffer sb = new StringBuffer();
			while((line= br.readLine())!= null)
			{
				sb = sb.append(line + "\n");
			}
			String[] cases = sb.toString().split("\n");
			String data = "";
			for(int i= 1;i<cases.length;i++)
			{
				
				int count = 0;
				String[] num = cases[i].split(" ");
				int surp = Integer.parseInt(num[1]);
				int p = Integer.parseInt(num[2]);
				int track = surp;
				for (int j = 3; j< num.length; j++)
				{
					int n = Integer.parseInt(num[j]);
					
					if (surp == 0)
					{
						int min = p + (p-1) + (p-1);
						if (n>=min)
						{
							count = count +1;
						}
						
					}
					else
					{
						int upper = p + (p-1) + (p-1);
						int lower = p + (p-2) + (p-2);
						if (p==1)
						{
							lower = 1;
						}
						if (n >= upper)
						{
							count = count +1;
						}
						else if(n>=lower && n < upper && track >0)
						{
							count = count + 1;
							track = track - 1;
						}
								
					}
					
					
				}
				
				data = data + "Case #"+i+": "+count+"\n";
				System.out.print("Case #"+i+": "+count+"\n");
				
			}
			File ff = new File("Output3.txt");
			if (ff.exists())
			{
				ff.delete();
			}
			BufferedWriter bw = new BufferedWriter(new FileWriter(ff, true));
			bw.write(data);
			bw.close();
		}
		catch(Exception e)
		{
			System.out.println(e);
		}

	}

}
