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.BufferedReader;
import java.io.IOException;
import java.io.PrintWriter;

class Factory implements TestCaseFactory {

	@Override
	public TestCase getInstance(int number) {
		return new DancingWithGooglers(number);
	}
}

public class DancingWithGooglers extends TestCase {

	int caseItem;

	int ngooglers;
	int[] scores;
	int surprising;
	int target;

	int max;

	public DancingWithGooglers(int caseItem) {
		this.caseItem = caseItem;
	}

	@Override
	public void readInput(BufferedReader in) throws IOException,
			MalformedInputFileException {
		final String str1 = in.readLine();
		final String[] tokens = str1.split("\\s");
		ngooglers = Integer.parseInt(tokens[0]);
		surprising = Integer.parseInt(tokens[1]);
		target = Integer.parseInt(tokens[2]);
		scores = new int[ngooglers];
		for (int i = 0; i < ngooglers; i++) {
			scores[i] = Integer.parseInt(tokens[i + 3]);
		}
	}

	private int guaranteedMax(int googler) {
		if (scores[googler] == 0) {
			return 0;
		} else {
			return (scores[googler] - 1) / 3 + 1;
		}
	}

	private int higherScores(int googler) {
		if (scores[googler] == 3) {
			return 0;
		} else {
			return (scores[googler] - 1) % 3 + 1;
		}
	}

	@Override
	public void solve() {
		int guaranteed = 0;
		int marginal = 0;
		for (int googler = 0; googler < ngooglers; googler++) {
			final int guaranteedMax = guaranteedMax(googler);
			if (guaranteedMax >= target) {
				guaranteed++;
			} else if (guaranteedMax == target - 1
					&& higherScores(googler) >= 2 && scores[googler] > 0) {
				marginal++;
			}
		}
		max = guaranteed + Math.min(marginal, surprising);
	}

	@Override
	public void writeOutput(PrintWriter out) {
		out.print("Case #" + (caseItem + 1) + ": ");
		out.print(max);
		out.print("\n");

	}

	public static void main(String[] args) throws IOException,
			MalformedInputFileException {
		new Processor().process(new Factory(), args[0], args[1]);
	}
}