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.ArrayList;
import java.util.List;

import Utils.FileHelper;


public class Gcj2012b {

	
	
	private void solve(String inputPath, String filepath) {
		
		FileHelper fHelper = new FileHelper(inputPath);
		
		String[] inputStr= new String[fHelper.getTotalSize()];
		
		List<String> rstList = new ArrayList<String>();
		
		fHelper.init(inputStr);
		
		for (String str : inputStr) {
			rstList.add(this.caculate(str));
		}
		
		rstList = format(rstList);
		
		FileHelper.writeFile(filepath, rstList);
	}
	
	
	private String caculate(String str) {
		String [] inputList = str.split(" ");
		
		int rawCnt = 0;
		int supCnt = 0;
		
		int total = Integer.parseInt(inputList[0]);
		int suprise = Integer.parseInt(inputList[1]);
		int point = Integer.parseInt(inputList[2]);
		
		int[]inputs = new int[inputList.length - 3];
		
		for(int i = 3; i< inputList.length;++i){
			inputs[i - 3] = Integer.parseInt(inputList[i]);
		}
		
		for(int v : inputs){
			int rst = v / 3;
			int remain = v % 3;
			
			if(remain == 0){
				if(rst >= point) rawCnt ++;
				else if(rst >= point - 1 && rst >=1) supCnt ++;
			}else if(remain == 2){
				if(rst >= point -1)rawCnt ++;
				else if(rst >= point -2 && rst >=1) supCnt ++;
			}else if(remain == 1){
				if(rst >= point - 1) rawCnt ++;
			}
		}
		
		
		return rawCnt + Math.min(suprise, supCnt) +"";
	}


	public static void main(String[] args) {

		Gcj2012b gcj2012b = new Gcj2012b();

		String inputPath = "C:\\Users\\xiaohfan\\Desktop\\B-small-attempt0.in";

		String filepath = "C:\\Users\\xiaohfan\\Desktop\\output.txt";
		
		gcj2012b.solve(inputPath, filepath);

	}




	public static List<String> format(List<String> rstList) {
		
		List<String> outputList = new ArrayList<String>();
		
		for(int i = 0; i < rstList.size();++i	){
			outputList.add("Case #"+ (i+1) +": "+rstList.get(i));
		}
		
		return outputList;
	}
}
