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 DancingWithGooglers {
	public static void main(String... args) throws Exception {

		BufferedReader br = new BufferedReader(new FileReader(
				System.getProperty("user.home") + "/Desktop/googlers.in"));

		Map<Integer, TripleCounter> dictionary = new HashMap<Integer, TripleCounter>();

		for (int x = 0; x <= 10; x++) {
			dictionary.put(x + x + x, new TripleCounter(x, x, x, false));
			if (x >= 10)
				continue;
			dictionary
					.put(x + x + x + 1, new TripleCounter(x, x, x + 1, false));
			dictionary.put(x + x + 1 + x + 1, new TripleCounter(x, x + 1,
					x + 1, false));
		}

		Map<Integer, TripleCounter> specialdictionary = new HashMap<Integer, TripleCounter>();

		for (int x = 0; x <= 8; x++) {
			specialdictionary.put(x + x + x + 2, new TripleCounter(x, x, x + 2,
					true));
			specialdictionary.put(x + x + 2 + x + 2, new TripleCounter(x,
					x + 2, x + 2, true));
			specialdictionary.put(x + x + 1 + x + 2, new TripleCounter(x,
					x + 1, x + 2, true));
		}

		int times = Integer.parseInt(br.readLine());

		for (int i = 0; i < times; i++) {
			googlers(br.readLine(), dictionary, specialdictionary, i + 1);
		}

	}

	public static void googlers(String line,
			Map<Integer, TripleCounter> dictionary,
			Map<Integer, TripleCounter> specialdictionary, int num) {
		String[] split = line.split(" ");

		int special = Integer.parseInt(split[1]);
		int p = Integer.parseInt(split[2]);
		List<Integer> scores = new ArrayList<Integer>();
		int count = 0;

		for (int i = 3; i < split.length; i++) {
			scores.add(Integer.parseInt(split[i]));
		}

		for (int i : scores) {
			TripleCounter c = dictionary.get(i);
			if (c != null && c.hasGreaterOrEqualTo(p)) {
				count++;
				continue;
			}
			
			c = specialdictionary.get(i);
			if (special > 0) {
				if (c != null && c.hasGreaterOrEqualTo(p)) {
					count++;
					special--;
				}
			}
		}
		
		System.out.println("Case #" + num + ": " + count);
	}

}

class TripleCounter {

	public int x, y, z;
	public boolean special;

	public TripleCounter(int x, int y, int z, boolean special) {
		this.x = x;
		this.y = y;
		this.z = z;
		this.special = special;
	}

	public boolean hasGreaterOrEqualTo(int num) {
		return (x >= num || y >= num || z >= num);
	}

	@Override
	public String toString() {
		return "(" + x + ", " + y + ", " + z + ", " + special + ")";
	}

}
