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


public class B {

	
	public static void main(String[] args) throws IOException {
//		Scanner in = new Scanner(new File("in/B/test.in"));
		Scanner in = new Scanner(new File("in/B/small.in"));
//		Scanner in = new Scanner(new File("in/B/big.in"));
//		BufferedWriter bw = new BufferedWriter(new FileWriter(
//				"out/B/test.out"));
		BufferedWriter bw = new BufferedWriter(new FileWriter(
				"out/B/small.out"));
//		BufferedWriter bw = new BufferedWriter(new FileWriter(
//				"out/B/big.out"));
		int cases = in.nextInt();
		for(int c = 1; c <= cases; c++){
			int competitors = in.nextInt();
			int surprises = in.nextInt();
			int minNote = in.nextInt();
			int winners = 0;
			for(int i = 0; i < competitors; i++){
				int max = 0, normal = 0;
				int note = in.nextInt();
				System.err.println(note);
				if(note == 0){
					max = 0;
					normal = 0;
				}else if(note == 1){
					max = 1;
					normal = 1;
				}else if(note > 27){
					max = 10;
					normal = 10;
				}else{
					int mod = note%3;
					max = note/3 + (mod==0?1:mod);
					normal = max - (mod!=1?1:0);
				}
				if(normal >= minNote){
					winners++;
					continue;
				}
				if(max == minNote && surprises > 0){
					surprises--;
					winners++;
					continue;
				}
			}
			bw.write("Case #" + (c) + ": "+winners);
			System.err.println("Case #" + (c) + ": "+winners);
			bw.newLine();
		}
		in.close();
		bw.flush();
		bw.close();
	}
}
