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 duarte.codejam;

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

public class Googlers {

	private static int caseNumber = 1;
	
	public static void main(String[] args) throws IOException{

		List<String> entradas  = new ArrayList<String>();
		BufferedReader input =  new BufferedReader(new FileReader(new File("B-small-attempt3.in")));
		input.readLine();
		while(input.ready())
			entradas.add(input.readLine());
		for(String s : entradas){
			String[] argumentos = s.split(" ");
			String[] notas = Arrays.copyOfRange(argumentos, 3, argumentos.length);
			System.out.println("Case #" + caseNumber++ + ": "+top(Integer.valueOf(argumentos[0]),Integer.valueOf(argumentos[1]),Integer.valueOf(argumentos[2]),notas));
		}
	}
	
	public static int top(int qtdGooglers, int surpresas, int notaMinima, String... notasMaximas){
		int[][] triplets = new int[qtdGooglers][3];
		int googler = 0;
		for(String notaMax : notasMaximas){
			int notaMaxi = Integer.valueOf(notaMax);
			triplets[googler][0] = notaMaxi/3;
			triplets[googler][1] = notaMaxi/3;
			triplets[googler][2] = notaMaxi/3;
			int diff = notaMaxi - (triplets[googler][0] + triplets[googler][1] + triplets[googler][2]);
			if(diff > 0){
				triplets[googler][0] += Math.min(1, diff--);
				triplets[googler][1] += diff;
			}
			googler += 1;
		}
		
		List tripletsTop = new ArrayList();
		for(int[] triplet : triplets){
			if(temNotaMaiorOuIgual(triplet, notaMinima)){
				tripletsTop.add(triplet);
			}
		}
		
		List tripletsAltas = new ArrayList();
		
		for(int[] triplet : triplets){
			if(tripletPossivel(triplet, notaMinima - 1) && !tripletsTop.contains(triplet)){
				tripletsAltas.add(triplet);
			}
		}
		
		
		
		return tripletsTop.size() + Math.min(tripletsAltas.size(), surpresas);
	}

	private static boolean tripletPossivel(int[] triplet, int i) {
		int notasProximas = 0;
		if(triplet[0] == i) notasProximas++;
		if(triplet[1] == i) notasProximas++;
		if(triplet[2] == i) notasProximas++;
		if (notasProximas < 2) return false;
		return (triplet[0] + triplet[1] + triplet[2] > i );
	}

	private static boolean temNotaMaiorOuIgual(int[] triplet, int notaMinima) {
		return (triplet[0] >= notaMinima || triplet[1] >= notaMinima || triplet[2] >= notaMinima );
	}

	public static int top(int qtdGooglers, int surpresas, int notaMinima, int... i) {
		String[] notas = new String[i.length];
		for(int j = 0 ; j < i.length; j++)
			notas[j] = String.valueOf(i[j]);
		return top(qtdGooglers, surpresas, notaMinima, notas);
	}
	
}
