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 codejam2012.qualified;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

public class ProblemB {

	static BufferedReader buffReader = null;
	static BufferedWriter buffWriter = null;
	static FileReader fileReader = null;
	static FileWriter fileWriter = null;
	static String input_test = "/home/qimeng/problemB.test";
	static String input_small =  "/home/qimeng/B-small-attempt1.in";
	static String input_large = "/home/qimeng/B-small-attempt1.out";

	public static final void main(String[] args){
		try {
			fileReader = new FileReader(input_small);
			buffReader = new BufferedReader(fileReader);
			fileWriter = new FileWriter("/home/qimeng/problemB.out");
			buffWriter = new BufferedWriter(fileWriter);

			int total_size = Integer.parseInt(buffReader.readLine());
			//iterate through every input line
			for(int i=1; i<=total_size; i++){
				String[] str = buffReader.readLine().split(" ");
				int strLen = str.length;
				
				int T = Integer.parseInt(str[0]);
				int s = Integer.parseInt(str[1]);
				int p = Integer.parseInt(str[2]);
				
				int[] scores = new int[T];
				
				int k = 0;
				for(int j=3; j<strLen; j++){					
					scores[k] =  Integer.parseInt(str[j]);
					k++;
				}
				
				
				System.out.println("Case #" +i+": " + danceAlgorithm(s, p, scores));
				buffWriter.write("Case #" +i+": " + danceAlgorithm(s, p, scores));
				buffWriter.newLine();
				buffWriter.flush();
			}


		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		} finally {
			try {
				buffWriter.flush();		
				buffWriter.close();
				buffReader.close();
				fileReader.close();
				fileWriter.close();
			} catch (IOException e) {
				e.printStackTrace();
			}
		}
	}

	
	private static int danceAlgorithm(int s, int p, int[] scores){		
		int result = 0;
		
		int i = 0;
		while(i < scores.length){
			int score = scores[i];
			if(score == 0 && p != 0){
				i++;
				continue;
			}
			
			int avg = score / 3;
			int rem = scores[i] % 3;
			
			//System.out.println("p:"+ p +"  avg: "+avg+"  rem: "+rem);
			if(avg >= p){
				result++;
			}		
			else {
				if(rem == 0){
					if(avg + 1 >= p) { 
						if(s>0){
							result++;
							s--;
						}
					}
				}
				else if(rem == 1){
					if(avg + 1 >= p) { result++; }
				}
				else if(rem == 2){
					if(avg + 2 >= p) { 
						if(avg+1>=p){ result++;}
						else{
							if(s>0){
								result++;
								s--;
							}
						}
					}
				}
			}
			i++;
		}
		
		return result;
	}
}
