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.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class DancingGoogle {

	/**
	 * @param args
	 * @throws IOException 
	 */

	
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		BufferedReader in = new BufferedReader(new FileReader("./test2.txt"));
		FileWriter fstream = new FileWriter("./out2.txt");
		BufferedWriter out = new BufferedWriter(fstream);
		
		String str,str2;
		
		int i = 0;
		
		DancingGoogle mydg = new DancingGoogle();
		
		int numTestCase = Integer.parseInt(in.readLine());
		while ((str = in.readLine()) != null) {
			str2="";
			int numOK = 0;
			String[] toks;
			toks = str.split(" ");
			int numGoogles = Integer.parseInt(toks[0]);
			int numSP = Integer.parseInt(toks[1]);
			int criteria = Integer.parseInt(toks[2]);
			for(int j =3;j<toks.length;j++)
			{
				int temp = Integer.parseInt(toks[j])/3;
				int rm = Integer.parseInt(toks[j])%3;
				if(temp >= criteria) {
					numOK++;
					continue;
				}
				int diff = criteria - temp;
				if(rm > diff){
					numOK++;
					continue;
				} 
				else if( rm == 1 && diff == 1)
				{
					numOK++;
					continue;
				} 
				else if(rm == 2 && diff == 2 && numSP > 0)
				{
					numOK++;
					numSP--;
					continue;
				}
				else if(rm < diff && diff ==1 && numSP > 0 && temp-diff >=0)
				{
					numOK++;
					numSP--;
					continue;
				}

			}
			str2 = "Case #" + (++i) + ": " + numOK + "\n";
			out.append(str2);
			System.out.print(str2);
		}
		in.close();
		out.close();
	}

}
