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

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class DancingGooglers {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException{
		Scanner scan = new Scanner(new File("B-small-attempt5.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter("B-small-attempt5.out"));
		
		int testCases = scan.nextInt();
		Map<Double, Integer> mapa = new HashMap<Double, Integer>();
		mapa.put(3d,2);
		mapa.put(6d,3);
		mapa.put(9d,4);
		mapa.put(12d,5);
		mapa.put(15d,6);
		mapa.put(18d,7);
		mapa.put(21d,8);
		mapa.put(24d,9);
		mapa.put(27d,10);
		
		for(int i=0; i < testCases; i++){
			int googlers = scan.nextInt();
			int s = scan.nextInt();
			int p = scan.nextInt();
			int bestResults = 0;
			
			for(int j=0; j < googlers; j++){
				double qual = scan.nextInt();
				
				double firstSecond = Math.round(qual/3d);
				double third = qual-(firstSecond*2);
				
				if(firstSecond >= p || third >= p) {
					bestResults++;
				} else if(s > 0 && p-third <= 2 && third <= firstSecond && !(((third+2)-(firstSecond-1)) > 2) && (third+2) <= 10) {
					bestResults++;
					s--;
				} else if(third == firstSecond && mapa.get(qual) != null && mapa.get(qual) >= p && s > 0){
					bestResults++;
					s--;
				} 
			}
			
			bw.write("Case #"+(i+1)+": "+bestResults+"\n");
		}
		bw.flush();
		bw.close();
	}

}
