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.io.*;
import java.util.*;
public class Prob2 {
	public static PrintStream out;
	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner(new File("in.txt"));
		out = new PrintStream(new File("out.txt"));
		int numCases = Integer.parseInt(sc.nextLine());
		int caseNum = 1;
		while(caseNum<=numCases)
			solve(sc.nextLine(), caseNum++);
	}
	public static void solve(String input, int caseNum){
		StringTokenizer st = new StringTokenizer(input, " ");
		int numPeople = Integer.parseInt(st.nextToken());
		int numSurprising = Integer.parseInt(st.nextToken());
		int p = Integer.parseInt(st.nextToken());
		LL scores = new LL();
		for(int i=0; i<numPeople; i++)
			scores.push(Integer.parseInt(st.nextToken()));
		Collections.sort(scores);
		int surePass = removeSurePassed(scores, p);
		removeSureUnsurprised(scores);
		int canPass = countCanPass(scores, p);
		int answer = surePass + Math.min(canPass, numSurprising);
		out.println("Case #"+caseNum+": "+answer);
		caseNum++;
	}
	public static void removeSureUnsurprised(LL scores){
		while(!scores.isEmpty() && scores.getFirst()<=1)
			scores.removeFirst();
	}
	public static int removeSurePassed(LL scores, int p){
		int surePassLimit = 3*p-2;
		int origLength = scores.size();
		while(!scores.isEmpty() && scores.getLast()>=surePassLimit)
			scores.removeLast();
		return origLength - scores.size();
	}
	public static int countCanPass(LL scores, int p){
		int canpass = 0;
		for(int i=0; i<scores.size(); i++){
			int cur = scores.get(i);
			if(cur%3==0){
				if(cur/3+1 >= p)
					canpass++;
			}else if(cur%3==2){
				if((cur-2)/3+2 >= p)
					canpass++;
			}
		}
		return canpass;
	}
	public static class LL extends LinkedList<Integer>{}
}
