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.io.*;
import java.util.*;
import static java.lang.System.*;

public class B {
	public static void main (String [] args) throws IOException {new B().run();}
	public void run() throws IOException{
		Scanner file = new Scanner(new File("B-small-attempt0.in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("B.out")));
		int times = Integer.parseInt(file.nextLine());
		for(int asdf = 0; asdf<times; asdf++){
			int n = file.nextInt();
			int s = file.nextInt();
			int p = file.nextInt();
			int[] ar = new int[n];
			for(int i = 0; i<n; i++)
				ar[i] = file.nextInt();
			Arrays.sort(ar);
			int count = 0;
			for(int i = n-1; i>=0; i--){
				int x = ar[i];
				int m1 = pos(x,false);
				int m2 = pos(x,true);
				if( m1 >= p ) count++;
				else if( m2 >= p && s>0 ){
					count++;
					s--;
				}
			}
			out.println ("Case #"+(asdf+1)+": "+count);
		}
		out.close();
		System.exit(0);
	}
	public int pos(int x, boolean s){
		int div = (int)Math.ceil(x/3.);
		int max = 0;
		for(int a = Math.max(0,div-2); a<div+2; a++)
		for(int b = Math.max(0,div-2); b<div+2; b++)
		for(int c = Math.max(0,div-2); c<div+2; c++){
			int dif = Math.max(Math.max(a,b),c)-Math.min(Math.min(a,b),c);
			if( dif >2 || a+b+c!=x || (!s&& dif==2))continue;
			max = Math.max(Math.max(a,b),Math.max(max,c));
		}
		return max;
	}
}