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.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Scanner;


public class DancingWithGooglers {

	public static void main(String[] args) throws IOException{
		
		String path = "C:\\Users\\Rapol Tongchenchitt\\Documents\\CodeJam\\";
		String year = "Qual2012\\";
		
		String test = "input.txt"; String outPath = "output.txt";
		String a = ""; String A = "";
		String b = "B-small-attempt0.in"; String B = "B-small-attempt0.out";
		String c = ""; String C = "";
		String d = ""; String D = "";
		
		String inName = path+year+b;
		String outName = path+year+B;
		
		Scanner in = new Scanner(new FileInputStream(inName));
		BufferedWriter out = new BufferedWriter(new FileWriter(outName));
		
		int caseCount = in.nextInt(); int currentCase = 0;
		
		while(currentCase++ < caseCount){
			
			int dancerCount = in.nextInt();
			int surpriseCount = in.nextInt();
			int minScore = in.nextInt();
			
			int goodCount = 0;
			int maybeCount = 0;
			
			for(int i = 0; i < dancerCount; i++){
				int now = in.nextInt();
				int min;
				
				switch(now%3){
				case 0:
					min = now/3;
					if(min == 0){
						if (minScore == 0){
							goodCount++;
						}
					}else if(min >= minScore){
						goodCount++;
					}else if(min + 1 == minScore){
						maybeCount++;
					}
					break;
					
				case 1:
					min = (now/3) + 1;
					if(min >= minScore){
						goodCount++;
					}
					break;
					
				case 2:
					min = (now/3) + 1;
					if(min >= minScore){
						goodCount++;
					}else if(min + 1 == minScore){
						maybeCount++;
					}
					break;
					
				}
			}
			
			goodCount += Math.min(maybeCount, surpriseCount);
			
			out.write("Case #" + currentCase + ": " + goodCount);
			out.newLine();
		}
		
		out.close();
		
	}
	
}
