import java.io.BufferedWriter;
import java.io.File;
import java.io.FileOutputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Scanner;


public class Dancing_With_the_Googlers {


    /**
     * The first line of the input gives the number of test cases, T.
     *  T test cases follow. 
     *  Each test case consists of a single line containing integers separated by single spaces. 
     *  The first integer will be N, the number of Googlers, and the second integer will be S, the number of surprising triplets of scores. 
     *  The third integer will be p, as described above. Next will be N integers ti: the total points of the Googlers. 
     * @throws IOException
     */
	   public static void main(String[] args) throws IOException {
	        // TODO Auto-generated method stub
			// Reading the input file
			Scanner in = new Scanner(new File("B-large.in"));
			// writting the input file
			FileOutputStream fos = new FileOutputStream("B-large.out");
			PrintStream out = new PrintStream(fos);
	         //Close the output stream
	        int testCase=Integer.parseInt(in.nextLine());
	        for(int i=0;i<testCase;i++) {
	        	out.print("Case #" + (i + 1) + ":\t");
	        	int NoOfGooglers= in.nextInt();
	        	int NoOfSurprisingResults = in.nextInt();
	        	int atLeastP=in.nextInt();
	        	ArrayList<Integer> scores= new ArrayList<Integer>();
        		int BestResults=0;
        		int Surprising=0;
	        	for(int j=0;j<NoOfGooglers;j++)
	        	{
	        		scores.add(in.nextInt());
	        		//System.out.print(scores.get(j));
	        		int modulus=scores.get(j)%3;
	        		int temp = scores.get(j);
	    			switch (modulus) {
					case 0:
						if (((temp / 3) >= atLeastP)) {
							BestResults++;
						} else {
							if (((((temp / 3) + 1) >= atLeastP) && ((temp / 3) >= 1))
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
								
							}
							System.out.println("Case 0"+"itr:"+i+"  surprising:"+temp);
						}
						
						break;
					case 1:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
							continue;
						}
						
						break;
					case 2:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
						} else {
							if (((temp / 3) + 2 >= atLeastP)
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
							}
							System.out.println("Case 2"+"itr:"+i+"  surprising:"+temp);
						}
						break;
					default:
						System.out.println("Error");
					}
	    			
				}// Internal for
				out.println(BestResults);
				// System.out.println(BestResults);
				System.out.println(Surprising);
				BestResults = 0;
			}// for
			in.close();
			out.close();
			fos.close();

	   }
}

import java.io.*;
import java.util.*;

public class B_Qual {
	static int n, s, score;
	static int inf = 1 << 25;
	static int[][] dp = new int[128][128];
	static int[] points=new int[128];
	public static int go(int index, int surprise) {
		if(surprise>s)return -inf;
		if (index == n) {
			if (surprise == s)
				return 0;
			return -inf;
		}
		if (dp[index][surprise] != -1)
			return dp[index][surprise];
		int res = 0;
		for (int i = 0; i <= 10; i++) {
			for (int j = -1; j <= 1; j++) {
				for (int k = -1; k <= 1; k++) {
					int a = i, b = i + j, c = i + k;
					int max = Math.max(Math.max(a, b), c);
					if (a+b+c==points[index]&&ValidTriple(a,b,c)&&!surp(a,b,c)) {
						if (max >= score)
							res = Math.max(res, 1 + go(index + 1, surprise));
						else
							res = Math.max(res, go(index + 1, surprise));
					}
				}
			}
		}
		for (int i = 0; i <= 10; i++) {
			for (int j = -2; j <= 2; j ++) {
				for (int k = -2; k <= 2; k ++) {
					int a = i, b = i + j, c = i + k;
					int max = Math.max(Math.max(a, b), c);
					if (a+b+c==points[index]&&ValidTriple(a,b,c)&&surp(a,b,c)) {
						if (max >= score)
							res = Math.max(res, 1 + go(index + 1, surprise + 1));
						else
							res = Math.max(res, go(index + 1, surprise + 1));
					}
				}
			}
		}
		return dp[index][surprise] = res;
	}

	private static boolean surp(int a, int b, int c) {
		int[] x={a,b,c};
		for (int i = 0; i < x.length; i++) {
			for (int j = 0; j < x.length; j++) {
				if(x[i]-x[j]==2)return true;
			}
		}
		return false;
	}

	private static boolean ValidTriple(int a, int b, int c) {
		int[] x={a,b,c};
		Arrays.sort(x);
		for (int i = 0; i < x.length; i++) {
			if(!valid(x[i]))
				return false;
		}
		for (int i = 0; i < x.length; i++) {
			for (int j = i+1; j < x.length; j++) {
				if(x[j]-x[i]>2)
					return false;
			}
		}
		return true;
	}

	private static boolean valid(int a) {
		return a >= 0 && a <= 10;
	}

	public static void main(String[] args) throws IOException {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for (int tt = 1; tt <= T; tt++) {
			for (int[] x : dp)
				Arrays.fill(x, -1);
			n = in.nextInt();
			s = in.nextInt();
			score = in.nextInt();
			for(int i=0;i<n;i++){
				points[i]=in.nextInt();
			}
			System.out.printf("Case #%d: %d\n", tt, go(0, 0));
		}
	}
}