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

import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * @author armin
 *
 */
public class DancingWithTheGooglers {

	static int maxscore(int points, boolean surp){
		if(points >= 29) return 10;
		if(points == 0) return 0;
		int div = points / 3;
		int mod = points % 3;
		
		if(surp){
			switch(mod){
			case 0: return div+1;
			case 1: return div+1;
			case 2: return div+2;
			default: return -1;
			}
		}else{
			return mod==0?div:div+1;
		}
	}
	
	static int min(int a, int b){
		return a<b?a:b;
	}
	
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		File in, out;
		Scanner sc;
		PrintWriter pr;
		
		in = new File("material.qualification/B-small-attempt0.in");
		//in = new File("material.qualification/DancingWithTheGooglers.in");
		out = new File("material.qualification/DancingWithTheGooglers.out");
		
		try{
			
			sc = new Scanner(new FileReader(in));
			pr = new PrintWriter(new FileWriter(out));
			
			
			int T = sc.nextInt();
			for(int cas=1;cas<=T;cas++){
				int N = sc.nextInt();
				int S = sc.nextInt();
				int p = sc.nextInt();
				
				int[] scores = new int[N];
				for(int i=0;i<N;i++) scores[i] = sc.nextInt();
				
				
				int ct1 = 0, ct2 = 0;
				int ms, sms;
				
				for(int i=0;i<N;i++){
					ms = maxscore(scores[i],false);
					sms = maxscore(scores[i], true);
					if(ms>=p) ct1+=1;
					if(ms<p && sms==p) ct2+=1;
				}
				
				int sol = ct1 + min(ct2, S);
				pr.println("Case #" + cas + ": " + sol);
				pr.flush();
			}
			
			
		}catch(IOException ioe){
			ioe.printStackTrace();
		}
		

	}

}
