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

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

public class DancingGooglers 
{
	String line="Code Jam";
	static int noOfTCs;
	
	public static void main(String[] args)
	{
		//initialize();
		new DancingGooglers().calculate();
		//generateOPFile();
	}
	
	private void calculate() 
	{
		try
		{
			BufferedReader br = new BufferedReader(new FileReader("C:/CodeJam/B-small-attempt1.in"));
			FileWriter fw = new FileWriter("C:/CodeJam/B-small-output.txt");
			BufferedWriter bw = new BufferedWriter(fw);
			line = br.readLine().trim();
			noOfTCs = Integer.parseInt(line);
			int dancers,surprises,maxScore;
			for(int testCase=0;testCase<noOfTCs;testCase++)
			{
				line = br.readLine().trim();
				String[] input = line.split(" ");
				dancers = Integer.parseInt(input[0]);
				surprises = Integer.parseInt(input[1]);
				maxScore = Integer.parseInt(input[2]);
				int sum,maxDancers=0;
				
				for(int i=3; i<input.length;i++)
				{
					sum =  Integer.parseInt(input[i]);
					int rem = sum%3;
					int result = sum/3;
					if(rem <= 1) 
					{
						if((result+rem)>=maxScore)
							maxDancers++;
						else if(rem == 0 && result > 0 && (result+1)>=maxScore && surprises > 0)
						{
							maxDancers++;
							surprises--;
						}
					}
					else
					{
						if((1+result) >= maxScore)
						{
							maxDancers++;
						}
						else
						{
							if(surprises > 0 && (rem+result) >= maxScore)
							{
								maxDancers++;
								surprises--;
							}
						}
					}
					
				}
				
				line = "Case #"+(testCase+1)+": "+maxDancers;
				System.out.println(line);
				bw.write(line);
				bw.newLine();
			}
			br.close();
			bw.close();
			System.out.println("Done !");
		}
		catch(Exception e)
		{
			e.printStackTrace();
		}
	}
	
	/*static void generateOPFile()
	{
		try
		{
			FileWriter fw = new FileWriter("C:/CodeJam/output.txt");
			BufferedWriter bw = new BufferedWriter(fw);
			for(int i=1;i<=noOfTCs;i++)
			{
				line = "Case #"+i+": "+1;
				bw.write(line);
				bw.newLine();
			}			
			bw.close();
		}
		catch(Exception e)
		{
			e.printStackTrace();
		}
	}*/

	/*static void initialize()
	{
		try
		{
			BufferedReader br = new BufferedReader(new FileReader("C:/CodeJam/C-small.in"));
			line = br.readLine().trim();
			noOfTCs = Integer.parseInt(line);
			br.close();
			
		}
		catch(Exception e)
		{
			e.printStackTrace();
		}
	}*/
}
