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.File;
import java.io.FileNotFoundException;
import java.io.FileReader;

import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashMap;

/** Main function is "solve" **/
public class CodeJamProblem2 {

		static HashMap<String,String> mappings=null;
		public static void main(String args[])
		{				
			solve();
		}

		private static void solve() {
				readFromInputAndWriteInOutput();			
		}

		private static void readFromInputAndWriteInOutput() {
			try {
				File f = new File("B-small-attempt1.in");
				FileReader fileReader = new FileReader(f);
				BufferedReader buff = new BufferedReader(fileReader);
				String totalTestCases = buff.readLine();
				PrintWriter printWriter = new PrintWriter("B-small-attempt1.out");
				int testCases = Integer.parseInt(totalTestCases);
				for(int i =1;i<=testCases;i++)
				{
					
					String line =  buff.readLine();
					String outputLine = "Case #"+i+": ";
					String result = solveForThisLine(line);
					outputLine = outputLine.concat(result);			
					printWriter.println(outputLine);
					//System.out.println(outputLine);
				}
				printWriter.close();
				
			} catch (FileNotFoundException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			} catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
			catch (Exception e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
		
		}

		private static String solveForThisLine(String line) {
			
			String splitS[] = line.split(" ");
			int numberOfGooglers = Integer.parseInt(splitS[0]);
			int numberOfSurprisingScores = Integer.parseInt(splitS[1]);
			int reqP = Integer.parseInt(splitS[2]);
			int result = 0;
			int number=0;
			int quo = 0;
			int rem = 0;
			for(int i = 3;i<splitS.length;i++)
			{
				number =Integer.parseInt(splitS[i]);
				if(number==0 && reqP==0)
				{
					
					result=result+1;
					continue;
				}
				if(number ==0 )
					continue;
				quo = number/3;
				rem = number%3;
				rem = rem==0? 0 : 1;
				if(quo>=reqP || (rem+quo)>=reqP)
				{
					result=result+1;
					continue;
				}
				else 
				{
					if(numberOfSurprisingScores>=1)
					{
						number +=2;
						quo = number/3;
						rem = number%3;
						rem = rem==0? 0 : 1;
						if(quo>=reqP || (rem+quo)>=reqP)
						{
							result=result+1;
							numberOfSurprisingScores=numberOfSurprisingScores-1;
							continue;
						}
					
					}
						
				}
			}
			return result+"";
		}
}
