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.File;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.Scanner;

public class B {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner scan = new Scanner(new File("B-small-attempt1.in"));
		System.setOut(new PrintStream("B-small-attempt1.out"));

		int t = scan.nextInt();
		for (int c = 0; c < t; c++) {
			int n = scan.nextInt(); // num
			int s = scan.nextInt(); // surprising
			int p = scan.nextInt(); // best result cutoff
			int[] totalPoints = new int[n];
			for (int i = 0; i < n; i++)
				totalPoints[i] = scan.nextInt();

			int sUsed = 0;
			int ans = 0;
			for (int i = 0; i < n; i++) {
				int pts = totalPoints[i];
				// can it be done normal?
				if (pts >= p + (p - 1) * 2)
					ans++;
				// can it be done surp?
				else if (pts >= p + Math.max(p - 2, 0) * 2)
					if (sUsed < s) {
						ans++;
						sUsed++;
					}
			}

			System.out.printf("Case #%d: %d%n", c + 1, ans);
		}
	}
}