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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;


public class qb {

	public static void main(String [] args)
	{
		String fileName = "B-small-attempt4.in";
		
		try{
			FileReader fr = new FileReader(fileName);
			BufferedReader br = new BufferedReader(fr);
			
			FileWriter fw = new FileWriter("output.txt");
			BufferedWriter bw = new BufferedWriter(fw);
			
			String line="";
			int count = 0;
			while((line=br.readLine())!=null)
			{
				if(count == 0)
				{
					count++;					
					continue;
				}
				String [] sp = line.split(" ");
				
				int [] rule = new int[3];	//rule 3°³¸¦ Áý¾î³ÖÀ½. 1.»ç¶÷¼ö, 2.¼­ÇÁ¶óÀÌÂ¡ °¹¼ö. 3.¸Æ½ºÁ¡¼ö				
				for(int i=0; i<3; i++)
					rule[i] = Integer.parseInt(sp[i]);

				
				int [] player = new int[sp.length-3];	//³ª¸ÓÁö µÚ¿¡ °ªµéÀÌ ÇÃ·¹ÀÌ¾î Á¡¼öÀÌ¹Ç·Î ´Æ.
				int [] playerScore = new int[player.length*3];	//ÇÑ»ç¶÷´ç ¼¼¸íÀÇ ½É»çÀ§¿ø Æò°¡ Á¡¼ö
				for(int i=0; i<player.length; i++)
					player[i] = Integer.parseInt(sp[i+3]);					
				
				for(int i=0; i<player.length; i++)		//½ºÄÚ¾î ºÐ¹è
				{
					if(player[i] % 3 == 0)
					{
						for(int j=0; j<3; j++)
						{
							playerScore[i*3] = player[i]/3;
							playerScore[i*3+1] = player[i]/3;
							playerScore[i*3+2] = player[i]/3;
						}
					}
					else if(player[i] % 3 == 1)
					{
						for(int j=0; j<3; j++)
						{
							playerScore[i*3] = player[i]/3+1;
							playerScore[i*3+1] = player[i]/3;
							playerScore[i*3+2] = player[i]/3;
						}						
						
					}
					else if(player[i] % 3 == 2)
					{
						for(int j=0; j<3; j++)
						{
							playerScore[i*3] = player[i]/3+1;
							playerScore[i*3+1] = player[i]/3+1;
							playerScore[i*3+2] = player[i]/3;
						}						
					}					
				}
				
				int nPlayerOverMax = 0;	
				int nPlayerCanSup = 0;
				int solution = 0;
				for(int i=0; i<player.length; i++) //°ËÃâ½Ä
				{
					if(rule[2]*3-3 < player[i])
						nPlayerOverMax++;
					else 
					{
						if(rule[2] < player[i] )
						{
							if(player[i] % 3 == 0 || player[i] %3 == 2)
							{
								
								if((playerScore[i*3]) +1 >= rule[2])
								{
									nPlayerCanSup++;
								}
							}
							else
							{
								if((playerScore[i*3]) >= rule[2])
									nPlayerCanSup++;
							}
								
						}
					}
				}
				if(nPlayerCanSup >= rule[1])
					solution = nPlayerOverMax + rule[1];
				else
					solution = nPlayerOverMax + nPlayerCanSup;
				
				if(solution > rule[0])
					solution = rule[0];
				
				bw.write("Case #"+count+": "+solution);
				bw.write("\n");
				count++;
			}
			
			bw.close();
			fw.close();
			br.close();
			fr.close();
			
				
		}catch(Exception EE)
		{
			EE.printStackTrace();
		}
		
		
	}
	
}
