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.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;

public class DanceAllNight {
	
	
	public static void main(String[] args) throws Exception
	{
		BufferedReader br = new BufferedReader(new FileReader(new File("test.txt")));
		BufferedWriter wr = new BufferedWriter(new FileWriter(new File("output.txt")));
		int count = Integer.parseInt(br.readLine());
		int yes,surprising,p,numsurprising,current,div3,output;
		String[] buffer;
		int[] values;
		for(int i=1; i<=count; i++)
		{
			String line = br.readLine();
			buffer = line.split(" ");
			values = new int[buffer.length];
			for(int j=0; j<buffer.length; j++)
			{
				values[j] = Integer.parseInt(buffer[j]);
			}
			yes = 0;
			surprising =0;
			p = values[2];
			numsurprising = values[1];
			
			for(int k=3; k<values.length; k++)
			{
				current = values[k];
				div3 = current/3;
				if(current % 3 == 0)
				{
					if(div3 >= p)
					{
						yes++;
					}
					else if(div3 == p-1  && current >= p)
						{
							surprising++;
						}
				}
				else if(current %3 == 1)
				{
					if(div3 >= p-1 && current >= p)
					{
						yes++;
					}
					
				}
				else
				{
					if(div3 >= p-1 && current >= p)
					{
						yes++;
					}
					else if(div3  == p-2 && current >= p)
					{
						surprising++;
					}
				}
					
				
			}
			output = Math.min(yes+surprising, yes+numsurprising);
			//make sure that its not more than the total # of contestants
			//output = Math.min(output, values[0]);
			wr.write("Case #"+i+": "+output);
			
			wr.newLine();
			
		}
		wr.close();
	}
	
}
