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.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;

public class DancingGoogle {

	public static void main(String[] args) {
		
		try {
			FileWriter fout = new FileWriter("B-small-attempt1.out");
		    BufferedReader in = new BufferedReader(new FileReader("B-small-attempt1.in"));
		    BufferedWriter out = new BufferedWriter(fout);
		    
		    int T = Integer.parseInt(in.readLine());
		    String[] input;
		    
		    
		    for(int i=0; i<T; i++)
		    {
		    	System.out.println();
		    	System.out.println("Case #" + (i+1));
		    	int overs = 0;
		    	input = in.readLine().split(" ");
		    	int numGooglers = Integer.parseInt(input[0]);
		    	int surprises = Integer.parseInt(input[1]);
		    	int p = Integer.parseInt(input[2]);
		    	System.out.println("Looking for scores of " + p + " or higher with " + surprises + " surprises.");
		    	
		    	for(int j=0; j<numGooglers; j++)
		    	{
		    		System.out.print("Googler " + (j+1) + ": ");
		    		if(Integer.parseInt(input[j+3]) >= p && p < 2)
		    			overs++;
		    		else if(Integer.parseInt(input[j+3]) >= ((p*3)-2) && ((p*3)-2) > 0){
		    			overs++;
		    			System.out.println(input[j+3] + " is bigger than or equal to " + ((p*3)-2));
		    		}
		    		else if(Integer.parseInt(input[j+3]) >= ((p*3)-4) && ((p*3)-4) > 0) {
		    			if(surprises > 0) {
		    				overs++;
		    				surprises--;
		    				System.out.println(input[j+3] + " is bigger than or equal to " + ((p*3)-4) + " if we use a surprise.");
		    			}
		    			else System.out.println(input[j+3] + " is not bigger enough.");
		    		}
		    		else System.out.println(input[j+3] + " is not bigger enough.");
		    	}
		    	System.out.println("Case #" + (i+1) + ": " + overs);
		    	fout.write("Case #" + (i+1) + ": " + overs);
		    	out.newLine();
		    	out.flush();
		    }
		    in.close();
		    out.close();
		    
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}
