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.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;

public class Pb2 {
	public static void main(String[] args) {
		try {
			PrintWriter writer = new PrintWriter("B-small-attempt0.out");
			BufferedReader reader = new BufferedReader(new FileReader("B-small-attempt0.in"));
			int lines = Integer.parseInt(reader.readLine());
			for(int i = 1; i <= lines; i++) {
				String line = reader.readLine();
				writer.println(processLine(i, line));
				writer.flush();
			}
			reader.close();
			writer.close();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}
	
	static StringBuffer processLine(int k, String str) {
		StringBuffer out = new StringBuffer("Case #" + k + ": ");
		Scanner scanner = new Scanner(str);
		int n = scanner.nextInt();
		int s = scanner.nextInt();
		int p = scanner.nextInt();
		int cat0 = 0;
		int cat1 = 0;
		int cat2 = 0;
		int cat3 = 0;
		int cat4 = 0;
		int cat29 = 0;
		for(int i = 0; i < n; i++){
			int tmp = scanner.nextInt();
			if(tmp == 0) {
				cat0++;
			} else if(tmp == 1) {
				cat1++;
			} else if(tmp >=29) {
				cat29++;
			} else if(2 <= tmp && tmp < (3*p-4) && p!= 2) {
				cat2++;
			} else if(tmp == (3*p-4) || tmp == (3*p-3)) {
				cat3++;
			} else {
				cat4++;
			}
		}
		int t = cat29 + cat4 + cat3;
		if(p == 0) {
			t = n;
		} else if(p == 1) {
			t = n - cat0;
		} else if(s < cat3) {
			t -= cat3 - s; 
		}
		
		return out.append(t);
	}

}
