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.FileOutputStream;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Arrays;
import java.util.StringTokenizer;


public class Code2 {


	
	private BufferedReader reader = null;
	PrintStream out = null;
	
	public static void main(String[] args) throws Exception {
		String file = "B-small-attempt0";
		Code2 code2 = new Code2();
		try {
	    code2.reader = new BufferedReader(new FileReader("source/" + file + ".in"));
		code2.out = new PrintStream(new FileOutputStream("source/" + file + ".out"));
		code2.runCases();
		} finally {
			code2.reader.close();
			code2.out.close();
		}
	}
	
	private void runCases() throws IOException {
		int cases = getInt();
		for (int c = 1; c <= cases; c++) {
			out.print("Case #" + c + ": ");
			execute();
			out.print("\n");
		}
	}
	
	private String readNext() throws IOException {
		String s = reader.readLine();
		return s;
	}
	
	private int getInt() throws IOException{
		String s= this.readNext();
		return Integer.valueOf(s);
	}
	
	private void execute() throws IOException {
		String s = this.readNext();		
		Code2DataStructure ds = new Code2DataStructure();
		StringTokenizer st = new StringTokenizer(s," ");
			ds.setNoOfGooglers(Integer.parseInt(st.nextToken()));
			ds.setSurprisingTrplets(Integer.parseInt(st.nextToken()));
			ds.setP(Integer.parseInt(st.nextToken()));
			int[] marks = new int[ds.getNoOfGooglers()];
			for (int i = 0; i < ds.getNoOfGooglers(); i++) {
				marks[i] = Integer.parseInt(st.nextToken());
			}
			ds.setMarks(marks);
			System.out.println("=========================");
			this.processData(ds);
			System.out.println("=========================");
		out.print(ds.getResult());
		
	}
	
	private void processData(Code2DataStructure ds) {
		int marks[] = ds.getMarks();
		Arrays.sort(marks);
		int nonsurprisingtripletsCount = 0;
		int surprisinggtripletsCount = 0;
		int requiredst = ds.getSurprisingTrplets();
		for (int i = 0; i < marks.length; i++) {
			if(this.isEligibleForMax(marks[i], ds.getP())) {
				if((marks[i] >= (3*ds.getP()-2)) && marks[i] >= ds.getP()) {
					nonsurprisingtripletsCount++;
				} else if((requiredst > 0) && marks[i] >= ds.getP()){
					requiredst--;
					surprisinggtripletsCount++;
				}
			}
		}
		System.out.println("nst "+nonsurprisingtripletsCount+" st "+surprisinggtripletsCount+" rst "+ds.getSurprisingTrplets());
//		if(surprisinggtripletsCount > ds.getSurprisingTrplets()) {
//			surprisinggtripletsCount = ds.getSurprisingTrplets();
//		}
		ds.setResult(surprisinggtripletsCount+nonsurprisingtripletsCount);
	}
	
	private boolean isEligibleForMax(int value, int p) {
		if(value >= (3*p - 4)) {
			return true;
		}
		return false;
	}
	
}
