package problem1;

import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Arrays;





public class Problem1 {

    public static void main(String[] args) throws FileNotFoundException, IOException{
        try {
             TextIO.readFile("L:\\Coodejam\\Input\\Input.txt");
        }
        catch (IllegalArgumentException e) {
              System.out.println("Can't open file ");
              System.exit(0);
         }
        
        FileOutputStream fout = new FileOutputStream("L:\\Coodejam\\Output\\output.txt");
        PrintStream ps=new PrintStream(fout);
        
        int cases=TextIO.getInt();
        int googlers=0,surprising=0,least=0;
        for(int i=0;i<cases;i++){
            int counter=0;
            googlers=TextIO.getInt();
            surprising=TextIO.getInt();
            least=TextIO.getInt();
            int score[]=new int[googlers];
            for(int j=0;j<googlers;j++){
                score[j]=TextIO.getInt();
                 }
            
            
            
            
            Arrays.sort(score);
            int temp=0;
            int sup[]=new int[surprising];
            
          for(int j=0;j<googlers && surprising>0;j++){
               if(biggestNS(score[j])<least && biggestS(score[j])==least){
                   surprising--;
                   counter++;
                }
               }
           
            for(int j=0;j<googlers;j++){
                if(surprising==0)temp=biggestNS(score[j]);
                    
                else {
                    temp=biggestS(score[j]);
                    surprising--;     
                } 
                   if(temp>=least)counter++;
           
             }
            
             ps.println("Case #"+(i+1)+": "+counter);
        }
    }
    
   static int biggestNS(int x){
       if(x==0)return 0;
       if(x==1)return 1;
       return ((x-1)/3)+1;
   }
   
   static int biggestS(int x){
       if(x==0)return 0;
       if(x==1)return 1;
       return ((x-2)/3)+2;
   }
}
import java.util.*;
import java.io.*;

public class Dancing
{
	static int[] scores;
	static int best,size;

	public static void main(String[] sArgs)throws IOException
	{
		Scanner oScan = new Scanner(new File("dancing.in"));
		PrintWriter out = new PrintWriter("dancing.out");

		int o_0 = oScan.nextInt();oScan.nextLine();
		for(int o_o=1;o_o<=o_0;o_o++)
		{
			int N=oScan.nextInt(),S=oScan.nextInt(),p=oScan.nextInt();
			best=p;
			size=N;
			scores = new int[N];
			for(int i=0;i<N;i++)
				scores[i]=oScan.nextInt();
			if(o_o<o_0-1)oScan.nextLine();
			//doBest(0,S);
			out.println("Case #"+o_o+": "+doBest(0,S));
		}

		out.close();
	}

	static int doBest(int a, int sup)
	{
		if(a==size)return 0;
		int tar = scores[a],max=0;
		for(int i=0;i<11;i++)
			for(int j=i;j<11&&j<i+3;j++)
				for(int k=j;k<11&&k<i+3;k++)
				{
					if(i+j+k!=tar||sup==0&&k==i+2)continue;
					//System.out.println(a+" "+i+" "+j+" "+k);
					int good = k>=best?1:0;
					max = Math.max(max,good+doBest(a+1,sup-(k==i+2?1:0)));
				}
		return max;
	}
}