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.File;
import java.io.IOException;
import java.util.Arrays;

public class QrB {
	private CodeJamTextInputReader input = null;
	private CodeJamTextOutputWriter output = null;

	public static void main(String args[]) {
		// CodeJamUtils.initLineEndings();
		try {
			QrB qrA = new QrB();
			qrA.run(new File(args[0]), new File(args[1]));
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (InvalidInputException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}

	public QrB() {
	}

	public void run(File outputFile, File inputFile)
			throws InvalidInputException, IOException {
		try {
			input = new CodeJamTextInputReader(inputFile);
			output = new CodeJamTextOutputWriter(outputFile);

			actualRun();
		} finally {
			if (input != null) {
				input.close();
			}
			if (output != null) {
				output.close();
			}
		}
	}

	private void actualRun() throws IOException {
		while (input.hasNextTestCase()) {
			String in = input.readNextLine();
			final int textCaseNum = input.getLastReadTestCaseNumber();

			output.outputTestCase(textCaseNum, singleTestCase(in));
		}
	}

	private String singleTestCase(String in) {
		CodeJamLineParser parser = new CodeJamLineParser(in);
		final int numOfParticipants = parser.readNextInt();
		final int numOfSurprising = parser.readNextInt();
		final int bestAtLeast = parser.readNextInt();
		final int[] totalScores = parser.readNextIntList(numOfParticipants);

		Arrays.sort(totalScores);

		int surprisingRemaining = numOfSurprising;
		int numOfCountedParticipants = 0;

		// Go from highest to lowest
		for (int i = numOfParticipants - 1; i >= 0; --i) {
			int curTotalScore = totalScores[i];
			if (bestScore(curTotalScore, false) >= bestAtLeast) {
				++numOfCountedParticipants;
			} else if (surprisingRemaining > 0 && canBeSurprising(curTotalScore)
					&& bestScore(curTotalScore, true) >= bestAtLeast) {
				++numOfCountedParticipants;
				--surprisingRemaining;
			}
		}

		return Integer.toString(numOfCountedParticipants);
	}

	boolean canBeSurprising(int totalScore) {
		// 0 and 1 are special cases.
		return totalScore >= 2;
	}
	
	int bestScore(int totalScore, boolean surprising) {
		int mod3 = totalScore % 3;
		int div3 = totalScore / 3;

		if (mod3 == 0) {
			return surprising ? (div3 + 1) : div3;
		} else if (mod3 == 1) {
			return div3 + 1;
		} else {
			return surprising ? (div3 + 2) : (div3 + 1);
		}
	}
}
