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.*;

public class CodeJam2 {

	
	public static void main(String[] args) 
	{
	Scanner input=new Scanner(System.in);
	int types=input.nextInt();
	for(int i=0;i<types;i++)
	{
	int count1=0,count2=0;
	int n=input.nextInt();
	int array2[]=new int[n];
	int surprise=input.nextInt();
	int p=input.nextInt();
	for(int j=0;j<n;j++)
	{
	array2[j]=input.nextInt();
	}		
	int array1[][]=new int[n][3];
	for(int j=0;j<n;j++)
	{
	array1[j][0]=array2[j]/3;
	int t=array2[j]-array1[j][0];
	int c1=t/2;
	int c2=t-c1;
	if(array2[j]!=0)
	{
	if(c1-c2==0)
	{
	if(p-c1==1)
	{
	if(count1<surprise)
	{
	count1++;
	count2++;
	array1[j][1]=c1--;
	array1[j][2]=c2++;
	}
	else
	{
	array1[j][1]=c1;
	array1[j][2]=c2;
	}
	}
	else if (p-c1==0)
	{
	array1[j][2]=c2;
	++count2;
	array1[j][1]=c1;
	}
	else if(p-c1>1)
	{
	array1[j][1]=c1;
	array1[j][2]=c2;
	}
	else if(p-c1<0)
	{
	array1[j][2]=c2;
	++count2;
	array1[j][1]=c1;
	}
	}
				
	else if((c2-c1)==1)
	{
	if(p<=c2)
	{
	array1[j][2]=c2;
	++count2;
	array1[j][1]=c1;
	}
	else 
	{
	array1[j][2]=c2;
	array1[j][1]=c1;
	}
	}
	}
	else{
	if(p==0)
	{
	++count2;
	}
	}
	}
	System.out.println("Case #"+(i+1)+": " +count2);
	}

	}

}
