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.FileReader;
import java.util.ArrayList;
import java.util.List;

public class ClientB {

	public static void main(String args[]) throws Exception {
		ClientB client = new ClientB();
		String[] inputLines = client.getInputLines(args[0]);

		int lineCount = Integer.valueOf(inputLines[0]);

		for(int i = 1; i <= lineCount; i++) {
			String currentLine = inputLines[i];
			String[] currentCase = currentLine.split(" ");
			
			int numOfGooglers = Integer.valueOf(currentCase[0]);
			int numOfSuprisingScoreTriplets = Integer.valueOf(currentCase[1]);
			int numOfBestResultGtEq = Integer.valueOf(currentCase[2]);
			
			//System.out.println("Min or better: " + numOfBestResultGtEq);
			//System.out.println("sup: " + numOfSuprisingScoreTriplets);
			
			List<int[]> baseScores = new ArrayList<int[]>();
			for(int j = 0; j < numOfGooglers; j++) {
				baseScores.add(client.fillScores(Integer.valueOf(currentCase[3+j])));
			}
			
			int[] processedScores = client.categorizeScores(baseScores, numOfBestResultGtEq);
			
			int sol = processedScores[0] + Math.min(numOfSuprisingScoreTriplets, processedScores[1]);
			
			System.out.println("Case #" + i + ": " + sol);
			//System.out.println();
		}
	}

	private int[] categorizeScores(List<int[]> scores, int bar) {
		int[] cat = {0, 0, 0}; //Good, bad, no potential (of being counted)
		
		for(int[] eachScoreSet : scores) {
			int maxScore = eachScoreSet[1]; //by def of fillScores alg
						
			if(maxScore >= bar) {
				cat[0]++;
			} else if(maxScore+1 == bar) {
				int oth = Math.max(eachScoreSet[0], eachScoreSet[2]);
				if(oth-1 >= 0 && (maxScore+1) - (oth-1) <= 2) {
					cat[1]++;
				} else {
					cat[2]++;
				}
			} else { //no hope
				cat[2]++;
			}
		}
		
		return cat;
	}
	
	private int[] fillScores(int maxValue) {
		int[] scores = {0, 0, 0};
		int totScore = 0;
		while(++totScore <= maxValue) {
			scores[totScore % 3]++;
		}
		//System.out.println("maxVal:" + maxValue +" {"+scores[0]+","+scores[1]+","+scores[2]+"}");
		return scores;
		
	}
	
	private String[] getInputLines(String fileName) throws Exception {
		BufferedReader reader = new BufferedReader(new FileReader(fileName));
		List<String> lines = new ArrayList<String>();
		String nextLine;
		while((nextLine = reader.readLine()) != null) {
			lines.add(nextLine);
		}
		return lines.toArray(new String[lines.size()]);
	}

}
