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.util.*;
import java.io.*;
import java.nio.*;
import java.nio.file.*;
import java.nio.charset.*;

public class danzig
{
	//arrays store each Googler's score info
	private static int[] total;
	private static int[] max;
	private static int[] modulo;
	
	private static int[] results;
	
	public static void main(String args[])
	{
		//int linesRead=0;
		//fileRead();
		Path file = Paths.get("C:\\Users\\Elena\\Documents\\george\\code jam\\B-small-attempt0.in");
		Charset cs = Charset.forName("US-ASCII");
		
		try(BufferedReader reader = Files.newBufferedReader(file, cs)){
			//#test cases setup
			int T = Integer.valueOf(reader.readLine());
			results = new int[T];
			
			//the 'main' loop
			for(int i=0; i<T; i++)
			{
				String lineStr = reader.readLine();
				//System.out.println(lineStr);
				String strAry[] = lineStr.split(" ");
				int N = Integer.valueOf(strAry[0]); //#Googlers
				int S = Integer.valueOf(strAry[1]); //#surprising scores
				int p = Integer.valueOf(strAry[2]); //target value
				
				//set array size
				total = new int[N];
				max = new int[N];
				modulo = new int[N];
				
				for(int j=0; j<N; j++)
					total[j] = Integer.valueOf(strAry[j+3]);
				
				Arrays.sort(total);
				//max and remainder
				for(int j=0; j<N; j++){
					modulo[j] = total[j]%3;
					if(modulo[j]==0)
						max[j] = total[j]/3;
					else
						max[j] = total[j]/3+1;
				}
				//System.out.println(S+"..."+Arrays.toString(max));
				
				//finds largest max values < p
				int n=0; //number of surprisings selected so far
				for(int j=N-1; j>=0; j--){
					if(n>=S) //do not exceed
						break;
					if(max[j]<p){
						if(modulo[j]!=1 && total[j]>=2){ //if remainder 0|2 then can increase
							n++;
							max[j]++;
						}
					}
				}
				/*System.out.println(Arrays.toString(total));
				System.out.println(p+"..."+Arrays.toString(max));
				System.out.println(Arrays.toString(modulo));*/
				
				//count number of matches
				tally(i,p);
				
				//System.out.print("\n");
			}
		} catch(IOException x) {
			System.out.println("oops read");
		}
		
		//System.out.println(Arrays.toString(results));
		fileWrite();
		
	}
	
	public static void tally(int pos, int target){
		int instances=0;
		for(int i=0; i<max.length; i++){
			if(max[i]>=target)
				instances++;
		}
		results[pos]=instances;
	}
	
	public static void fileWrite(){
		Path file = Paths.get("C:\\Users\\Elena\\Documents\\george\\code jam\\dancing.out");
		Charset cs = Charset.forName("US-ASCII");
		
		try(BufferedWriter writer = Files.newBufferedWriter(file, cs)){
			for(int i=0; i<results.length; i++){
				String line = "Case #" + (i+1) + ": " + results[i];
				writer.write(line);
				writer.newLine();
			}
		} catch(IOException x){
			System.out.println("oops write");
		}
	}
	
	/*public static void fileRead()
	{
		Path file = Paths.get("C:\\Users\\Elena\\Documents\\george\\code jam\\dancingsample.in");
		Charset cs = Charset.forName("US-ASCII");
		
		try(BufferedReader reader = Files.newBufferedReader(file, cs)){
			int T = Integer.valueOf(reader.readLine());
			//parses lines for meaningful numbers
			for(int i=0; i<T; i++)
			{
				String str = reader.readLine();
				String strAry = str.split()
			}
		} catch(IOException x) {
			System.out.println("oops read");
		}
	}*/
	
}