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.Scanner;
import java.lang.Math;

class q2{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		Score s = new Score();

		int size = new Integer(sc.nextLine());

		int j = 1;

		while(sc.hasNextLine() && size > 0){
			String str = sc.nextLine();
			String[] tok = str.split(" ");
			int nGooglers = new Integer(tok[0]);
			int sTrips = new Integer(tok[1]);
			int pScore = new Integer(tok[2]);
			int[] tPoints = new int[nGooglers];
			
			for(int i=3; i<nGooglers+3; ++i)
				tPoints[i-3] = new Integer(tok[i]);

			int best = s.in(nGooglers, sTrips, pScore, tPoints);
			
			System.out.println("Case #" + j + ": " + best);
			++j;
			--size;
		}
	}
}

class Score{

	public int in(int n, int s, int p, int[] t){
		int moreThanp = 0;
		for(int i=0; i<n; ++i){
			int ave = (int)Math.ceil(t[i]/3.00);
			int r = t[i]%3;
			
			if(ave >= p)
				++moreThanp;
			else if(s>0 && (r == 0 || r == 2) && t[i]>1){
				++ave;
				if(ave >= p){
					++moreThanp;
					--s;
				}
			}
		}
		
		return moreThanp;
	}
}


