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.*;

public class DancingGoogler{

    public static void main(String[] args){
	Scanner scanner = new Scanner(System.in);
	scanner.nextLine();
	int count = 1;
	while(scanner.hasNextLine()){
	    String[] tokens = scanner.nextLine().split(" ");
	    int numContestants = Integer.parseInt(tokens[0]);
	    int numSuprises = Integer.parseInt(tokens[1]);
	    int minScore = Integer.parseInt(tokens[2]);
	    int[] scores = new int[numContestants];
	    for(int i = 0; i < scores.length; ++i){
		scores[i] = Integer.parseInt(tokens[i + 3]);
	    }
	    DancingGoogler d = new DancingGoogler(numSuprises, minScore, scores);
	    System.out.println("Case #" + count + ": " + d.getNumGooglersWithMinScore());
	    ++count;
	}
    }

    public DancingGoogler(int numSuprises, int minScore, int[] scores){
	this.numSuprises = numSuprises;
	this.minScore = minScore;
	this.scores = scores;
    }

    public int getNumGooglersWithMinScore(){
	int count = 0;
	for(int score : scores){
	    if(score == 0){
		if(minScore == 0){
		    ++count;
		}
		continue;
	    }
	    if(score == 29){
		++count;
		continue;
	    }
	    if(score % 3 == 0){
		int av = score / 3;
		if(av >= minScore){
		    ++count;
		}else{
		    if(numSuprises > 0 && av >= minScore -1){
			++count;
			--numSuprises;
		    }
		}
		continue;
	    }
	    int av = score / 3;
	    int av1 = (score / 3) + 1;
	    int diffav = score - av * 3;
	    int diffav1 = av1 * 3 - score;
	    if(numSuprises > 0){
		if(diffav == 2){
		    if(av1 >= minScore){
			++count;
			continue;
		    }else{
			if(av >= minScore ||  score - av*2 >= minScore){
			    ++count;
			    --numSuprises;
			    continue;
			}
		    }
		}else{
		    if(av >= minScore || score -av * 2 >= minScore){
			++count;
			continue;
		    }
		    if(av1 >= minScore){
			++count;
			--numSuprises;
			continue;
		    }
		}
	    }else{
		if(diffav == 2){
		    if(av1 >= minScore){
			++count;
			continue;
		    }
		}else{
		    if(av >= minScore || score - av*2 >= minScore){
			++count;
			continue;
		    }
		}
	    }
	}
	return count;
    }

    private int numContestants;
    private int numSuprises;
    private int minScore;
    private int[] scores;
}