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;
	}
}

package codejam.b;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;

public class Main {
	
	public static void main(String[] args) {
		ProblemB b = new ProblemB();
		List<String> lines = CodejamFile.readLines("c:\\tmp\\B-small-attempt0.in");
		for (int i = 0; i < lines.size(); i++) {
			System.out.printf("Case #%d: %d\n", i + 1, b.process(lines.get(i)));
		}
	}
}

class ProblemB {
	
	private int S;	// the number of surprising triplets of scores
	private int p;	// threashold score
	
	// 3 1 5 15 13 11 -> 3
	// 3 0 8 23 22 21 -> 2
	public int process(String line) {
		int possiblity = 0;
		//System.out.println(line);
		
		String[] elements = line.split(" ");
		int N = Integer.parseInt(elements[0]);	// the number of Googlers
		S = Integer.parseInt(elements[1]);
		p = Integer.parseInt(elements[2]);
		
		for (int i = 0; i < N; i++) {
			int score = Integer.parseInt(elements[i + 3]);
			//System.out.printf("%d, %d\n", score / 3, score % 3);
			possiblity += getPossiblity(score) > 0 ? 1 : 0;
		}
		return possiblity;
	}
	
	private int getPossiblity(int score) {
		int r = 0;
		int avg = score / 3;
		
		switch (score % 3) {
		case 0:
			if (avg > p) {
				r = 3;
			} else if (avg == p) {
				//if (S > 0) {
					r = 2;
					//S--;
				//}
			} else if (avg == (p - 1)){
				if (avg == 0) {
					break;
				}
				
				if (S > 0) {
					r = 1;
					S--;
				}
			}
			break;
		case 1:
			if (avg >= p) {
				r = 3;
			} else if (avg == (p -1)) {
				//if (S > 0) {
					//S--;
					r = 2;
				//} else {
					//r = 1;
				//}
			}
			break;
		case 2:
			if (avg >= p) {
				r = 3;
			}
			if (avg == (p - 1)) {
				r = 2;
			}
			if (avg == (p -2)) {
				if (S > 0) {
					S--;
					r = 1;
				}
			}
			break;
		}
		
		return r;
	}
}

class CodejamFile {

	public static List<String> readLines(String path) {
		List<String> lines = new ArrayList<String>();
		
		try {
			FileReader in = new FileReader(path);
			BufferedReader br = new BufferedReader(in);
			String line;
			//
			br.readLine();	// line count
			//
			while ((line = br.readLine()) != null) {
				lines.add(line);
			}
			br.close();
			in.close();
		} catch (IOException e) {
			e.printStackTrace();
		}
		
		return lines;
	}
}
