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.util.Scanner;
import java.util.Arrays;
import java.io.*;
public final class problem1 {
	static int N;
	static int S;
	static int p;


	public static String getResult(int[] input){
		Arrays.sort(input);
		
		int min;
		if(p < 2)
			min = p;
		else
			min = p + (p-2) + (p-2);
			
		int sur = S;
		int total = 0;
		for(int i = 0 ; i < input.length ; i++){
			//System.out.print(input[i] + " " + min);
			//large than min surprise -> will handle this value
			if(input[i] >= min && input[i] <= 28){
				if(input[i] % 3 == 2){ //value like 11
					if(sur > 0){
						int large = input[i] / 3 + 2;
						if(large >= p){
							total++;
							sur--;
						}
					}else{
						int large = input[i] / 3 + 1;
						if(large >= p){
							total++;
						}
					
					}
					
				}else if(input[i] % 3 == 1){//value like 13
					if(sur > 0){
						int large = input[i] / 3 + 1;
						if(large >= p){
							total++;
							sur--;
						}
					}else{
						int large = input[i] / 3 + 1;
						if(large >= p){
							total++;
						}
					
					}
				
				
				}else{ // valeu like 15
					
					if(sur > 0){
						int large = input[i] / 3 + 1;
						if(large >= p){
							total++;
							sur--;
						}
					}else{
						int large = input[i] / 3;
						if(large >= p){
							total++;
						}
					}
				
				}
			
			}else if(input[i] > 28){
				total++;
			}
		
		}
		//System.out.println();
		return Integer.toString(total);
	}
	
	

	public static void main(String[] args){
		try{
			//Scanner sc = new Scanner(new File("yo.txt"));
			Scanner sc = new Scanner(new File("B-small-attempt0.in"));
			FileWriter fw = new FileWriter("small.txt");
		
			String tmp = sc.nextLine();
			int step = Integer.valueOf(tmp);
		
			int counter = 1;
			while(sc.hasNextLine()){

				String s = sc.nextLine();
				Scanner ssc = new Scanner(s);
				N = ssc.nextInt();
				S = ssc.nextInt();
				p = ssc.nextInt();
				
				int[] arr = new int[N];
				for(int i = 0 ; i < N ; i++)
					arr[i] = ssc.nextInt();

				String xx = getResult(arr);
				System.out.println("Case #" + counter + ": " + xx);
				
				
				fw.write("Case #" + counter + ": " + xx);
				fw.write("\n");
				counter++;
				if(step < counter)
					break;
			}
			fw.close();
		}catch(Exception e){}
		
	}
	
}