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;

/**
 *
 * @author Rashmika
 */
public class Main {
    
    public static void main(String[] args) {
        try {
            BufferedReader in = new BufferedReader(new FileReader("B-small-attempt0.in"));
            int numLines = 0, i=0;
            String str = "";
            String[] testRounds = new String[1];
            while ((str = in.readLine()) != null && str.length() != 0) {
                if(numLines!=0){
                    testRounds[i++] = str;
                }else{
                    numLines = Integer.parseInt(str);
                    testRounds = new String[numLines];
                }
            }
            
            for(int j=0; j<numLines-1; j++){
                output("Case #"+(j+1)+": "+getWinners(testRounds[j]) +"\n");
            }
                output("Case #"+(numLines)+": "+getWinners(testRounds[numLines-1]));
            
        } catch (IOException e) {
        }
        
        //System.out.println(""+getWinners("2 1 1 8 0"));
        
    }
    
    public static void output(String line){
        try{
          FileWriter fstream = new FileWriter("dancing.out",true);
          BufferedWriter out = new BufferedWriter(fstream);
          out.write(line);
          out.close();
          }catch (Exception e){//Catch exception if any
          System.err.println("Error: " + e.getMessage());
          }
    }
    
    public static int getWinners(String line){
        
        String[] temp = line.split(" ");
        int N = Integer.parseInt(temp[0]);
        int S = Integer.parseInt(temp[1]);
        int P = Integer.parseInt(temp[2]);
        int player[] = new int[N];
        
        for(int i=0; i<N; i++){
            player[i] = Integer.parseInt(temp[3+i]);
        }
        
        int winnerCount = 0;
        
        //for a single round
        int total;
        int n1;
        for(int i=0; i<N; i++){
            
            total = player[i];
            
            if(total==0){
                if(P<=0){
                    winnerCount++;
                    //System.out.println("Counted "+i);
                    continue;
                }                
            }else if(total%3==0){
                n1 = total/3;
                //System.out.println(i+":"+n1+"  "+total);
                if( (n1>=P) ){
                    //System.out.println("Counted "+i);
                    winnerCount++;
                    continue;
                }else if( (S>0) && ((n1+1)>=P) ){
                    //System.out.println("Counted "+i);
                    winnerCount++;
                    S--;
                    continue;        
                }
            }else if(total%3==1){
                n1 = total/3 + 1;
                //System.out.println(i+":"+n1+"  "+total);
                if( (n1>=P) ){
                    //System.out.println("Counted "+i);
                    winnerCount++;
                    continue;
                }
            }else if(total%3==2){
                n1 = total/3 + 1;
                //System.out.println(i+":"+n1+"  "+total);
                if( (n1>=P) ){
                    //System.out.println("Counted simile"+i);
                    winnerCount++;
                    continue;
                }else if( (S>0) && ((n1+1)>=P) ){
                    //System.out.println("Counted "+i);
                    winnerCount++;
                    S--;
                    continue;        
                }
            }
            
        }        
        return winnerCount;
        
    }
    
}