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.lang.*;
import java.util.*;
class dancer{
int count,s,p;
int doneS;
int can;
void Counts(int i1){
                    int thrice=3*p;
					if(i1>=thrice){count++;
								  can++;}
					else{int diff=(thrice-i1);
					    if(diff>4){can++;}
					     else if((diff==1)||(diff==2)){
						                             if(p==1){count++;
													          }
													if(p>=2){count++;
													       can++;}		  
												      }
						 else{
						      if(p>=2){count++;
						       doneS++;
							   }
							   }
                         }
						 
							   }}
//===========================
class p1{
public static void main(String args[]){
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
for(int i=0;i<n;i++){
dancer d1=new dancer();
int m=sc.nextInt();
d1.s=sc.nextInt();
d1.p=sc.nextInt();
for(int j=0;j<m;j++){
                      d1.Counts(sc.nextInt());  
   					   }
int sub=0;
if(d1.doneS==d1.s){}
else if(d1.doneS>d1.s){
                      sub=d1.doneS-d1.s;
					  }
else{sub=0;
	}					  
d1.count=d1.count-sub;;

System.out.println("Case #"+(i+1)+": "+d1.count);}
}}	