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

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;

public class DancingWithTheGooglers {
	final static String DIRECTORY = "ioFile";
	
	final static String FNAME = "B-small-attempt2";

	public BufferedReader in;

	public PrintWriter out;

	void open() throws IOException {
		in = new BufferedReader( new FileReader( new File( DIRECTORY + "/" + FNAME + ".in" ) ) );
		out = new PrintWriter( new File( DIRECTORY + "/" +  FNAME + ".out" ) );
	}

	void close() throws IOException {
		out.close();
	}
	
	void run() throws IOException {
		String nac = in.readLine();		
		for (int i=0; i<Integer.parseInt(nac); i++){
			int count = 0;
			String line = in.readLine();
			String [] sa = line.split(" ");
			int n = Integer.parseInt(sa[0]);
			int s = Integer.parseInt(sa[1]);
			int p = Integer.parseInt(sa[2]);
			List<Integer> list = new ArrayList<Integer>();
			for ( int j = 3; j < sa.length; j++) {
				list.add(Integer.parseInt(sa[j]));				
			}
			for ( int j =0; j<n && s>=0; j++) {
				int num = list.get(j);
				if ( num % 3 == 0) {
					if ( num/3 >= p)
						count ++;
					else if (num > 0 && s>0 &&  num/3+1 >=p) {
						s--;
						count++;
					}
				}
				else if ( num % 3 == 1 && num/3 +1 >=p	) {
					count ++;
				}
				else if ( num % 3 == 2 ) {
					if ( num/3 +1 >= p) 
						count ++;
					else if (s>0 &&  num/3 + 2 >=p ) {
						s--;
						count ++;
					}						
				}
//				if ( (num/3 ) >= p) 
//					count ++;
//				else if (num > 0 && s>0 && (num/3 + 2) >=p ) {
//					s--;
//					count++;
//				}
			}
			out.println("Case #" + (i+1) + ": " + count);
		}		
	}
	
	int count(String sNumber, char ch){
		int count=0;
		for(int i=0;i<sNumber.length();i++){
			if(sNumber.charAt(i)==ch)
				count++;
		}
		return count;
	}
	
	public static void main( String[] args ) throws IOException {
		new Thread() {

			public void run() {
				try {
					DancingWithTheGooglers solution = new DancingWithTheGooglers();
					solution.open();
					solution.run();
					solution.close();
				} catch ( Exception e ) {
					throw new RuntimeException( e );
				}
			}
		}.start();
	}
}
