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


public class DancingGooglers extends FileReaderWriter {

	/*//int[] GOOG = {29, 20, 8, 18, 18, 21};
	int[] GOOG = {23, 22, 21};*/
	
	DancingGooglers(String inPath, String outPath) throws IOException {
		super(inPath, outPath);
		reader();
		
	}
	
	@Override
	public void reader() throws IOException {
		super.writer();
		strLine = br.readLine();
		nTestCases = Integer.valueOf(strLine);
		
		int N, S, p;
		int nthCase = 0;
		
		int googlerCount = 0;
		
		String toWrite = new String();
		
		
		//While LOOP
		while( (strLine = br.readLine()) != null ) {
			googlerCount = 0;
			++nthCase;
			toWrite = toWrite + "Case #" + nthCase + ": ";
			String[] handler = strLine.split(" ");
			
			int[] GOOG = new int[handler.length];
			
			for(int i=0; i<handler.length; ++i) {
				GOOG[i] = Integer.valueOf(handler[i]);
			}
			
			N = GOOG[0];
			S = GOOG[1];
			p = GOOG[2];
			
			for(int i=3; i<GOOG.length; ++i) {
				int base = (int) GOOG[i] / 3;
				
				switch (GOOG[i] % 3) 
				{
					case 0:
					{
						if(base >= p)
							++googlerCount;
						else {
							if(S>0 && base>0 && base+1>=p) {
								++googlerCount;
								--S;
							}
						}
						break;
					}
					
					case 1:
					{
						if(base >= p || base+1 >= p) {
							++googlerCount;
						}
						else {
							if(S > 0 && base + 1 >= p) {
								++googlerCount;
								S--;
							}
						}
						break;
					}
					
					case 2:
					{
						if(base + 1 >= p || base >= p) {
							++googlerCount;
						}
						else {
							if(S > 0 && base + 2 >= p) {
								++googlerCount;
								--S;
							}
						}
						break;
					}
				}				
			}
			toWrite = toWrite + googlerCount + "\n";			
		}
		System.out.println(toWrite);
		bw.write(toWrite);
		bw.close();
	}

}
