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;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class Dancing {
	private static int[] data;
	
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader(new FileReader("A-small-practice.in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("A-small-practice.out")));
	    StringTokenizer st = new StringTokenizer(f.readLine());
	    
	    int tests = Integer.parseInt(st.nextToken());
	    
	    for (int t = 1; t <= tests; t++){
	    	out.printf("Case #%d:", t);
	    	st = new StringTokenizer(f.readLine());
		    int n = Integer.parseInt(st.nextToken());
		    int s = Integer.parseInt(st.nextToken());
		    int p = Integer.parseInt(st.nextToken());
		    data = new int[n];
		    for (int i = 0; i < n; i++){
		    	data[i] = Integer.parseInt(st.nextToken());
		    }
		    
		    out.printf(" %d\n", fun1(n, s, p));
	    }
	   
	    out.close();
	    System.exit(0);
	}
	
	private static int fun1(int n, int s, int p){
		int count = 0;
		int s_ = s;
		for (int i = 0; i < n; i++){
			int avg = data[i] / 3;
			
			if (data[i] % 3 == 0){				
				if(avg >= p) {
					count ++;
				} else{
					if((s_ > 0) && (avg + 1 >= p) && (avg - 1 >=0)){
						count ++;
						s_--;
					}
				}	
			} else if(data[i] % 3 == 1){
				if(avg + 1 >= p){
					count++;
				} 
			} else if(data[i] % 3 == 2){
				if(avg + 1 >= p){
					count ++;
				} else if((s_ > 0) && (avg + 2 >= p)){
					count++;
					s_--;
				}
			}
		}
		return count;
	}
}
