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.util.ArrayList;
import java.util.HashSet;


public class DancingWithTheGooglers {
private static String inputFile = "C:\\PERSONAL-WORKSPACE\\GCJ-2012\\src\\input-output\\Input.txt";
private static String outputFile = "C:\\PERSONAL-WORKSPACE\\GCJ-2012\\src\\input-output\\Output.txt";
public static void main(String[] args) {
	InputReader ir = new InputReader(inputFile);
	OutputWriter ow = new OutputWriter(outputFile);
	ArrayList<String> lines = ir.loadLines();	
	for(int i=1;i<lines.size();i++){
		int count = 0;
		Long[] arrL = GCJUtils.getLongArray(lines.get(i).split(" ",lines.get(i).length()));		
		long nst = arrL[1];
		long score = arrL[2]; 
		ArrayList<Long[]> al = new ArrayList<Long[]>();
		for(int j=3;j<arrL.length;j++){		
			Long[] scoresArr = new Long[3];
			long remainder = arrL[j]%3;
			long tmp = arrL[j]/3;			
			scoresArr[0] = scoresArr[1] = scoresArr[2] = tmp;
			for(int k=0;k<remainder;k++){
				scoresArr[k]++;
			}
			if(scoresArr[0] >=score || scoresArr[1] >=score ||scoresArr[2] >=score){
				count++;
			}else if(remainder!=1 ){
				al.add(scoresArr);
			}
		}
		for(int p=0;p<al.size();p++){
			Long[] arrLL = al.get(p);
			if(nst==0)break;
			if(arrLL[0]!=0 && arrLL[0]==(score-1)){
				count++;nst--;
			}
		}
		ow.writeCaseLine(count+"");
	}
	ow.flushAndClose();
}
}
