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.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Arrays;
import java.util.Scanner;


public class Scores 
{
	public static void main(String[] args) throws IOException 
	{
		Scanner scan = new Scanner(new File("B-small-attempt0.in"));
		FileWriter strm = new FileWriter("out2.txt");
		BufferedWriter out = new BufferedWriter(strm);
		int cases = scan.nextInt();
		scan.nextLine();
		int count = 1;
		while(count - 1 < cases)
		{
			int n = scan.nextInt();
			int s = scan.nextInt();
			int p = scan.nextInt();
			int[] tots = new int[n];
			for(int i = 0;i<n;i++)
			{
				tots[i] = scan.nextInt();
			}
			out.write("Case #" + count + ": " + calc(s,p,tots) + "\n");
			count++;
		}
		out.close();
	}
	private static int calc(int s, int p, int[] tots)
	{
		Arrays.sort(tots);
		int surp = 0;
		int max = 0;
		for(int i = 0;i<tots.length;i++)
		{
			if(possible(p,tots[i]))
			{
				boolean surprise = surp(p,tots[i]);
				if(surprise)
					surp++;
				if(surp<=s || !surprise)
					max++;
			}
		}
		return max;
	}
	private static boolean possible(int max, int total)
	{
		if(max == 0)
			return true;
		if(total / max >= 3.0)
			return true;
		if(total < max)
			return false;
		total -= max;
		return Math.abs(total / 2.0 - max) <= 2.0;
	}
	private static boolean surp(int max, int total)
	{
		if(max == 0)
			return false;
		if(total / max >= 3.0)
			return false;
		total -= max;
		return Math.abs(total / 2.0 - max) >= 1.5;
	}
}
