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.io.IOException;


public class DancingWithTheGooglers {

	static int surprise;
	
	public static void main(String[] args) throws IOException{
		BufferedReader in = new BufferedReader(new FileReader("small-B.in"));
		BufferedWriter out = new BufferedWriter(new FileWriter("small-B.out"));
		
		int n = Integer.parseInt(in.readLine());
		
		for(int i = 1; i <= n; i++){
			String [] nums = in.readLine().split(" ");
			
			int m = Integer.parseInt(nums[0]);
			surprise =  Integer.parseInt(nums[1]);
			int best =  Integer.parseInt(nums[2]);
			
			int total = 0;
			
			for(int j = 0; j < m; j++)
				if(check(Integer.parseInt(nums[j + 3]), best))
					total++;
			
			out.write("Case #" + i + ": " + total);
			if(i < n)
				out.write("\n");
		}
		in.close();
		out.close();
	}
	
	static boolean check(int score, int max){
		
		int third = score / 3;
		int rem = score % 3;
		
		if(third >= max)
			return true;
		
		if(third == max - 2)
			if(rem == 2){
				if(surprise > 0){
					surprise --;
					return true;
				}
				return false;
			}
			else
				return false;
		
		if(third == max - 1)
			if(rem > 0)
				return true;
			else if(surprise > 0 && third > 0){
				surprise --;
				return true;
			}
		
		return false;
	}

}
