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


public class Googlers {
	public static void main(String[] args) throws FileNotFoundException {

		Scanner in = new Scanner(new FileReader(new File("B-small-attempt1.in")));
		
		PrintWriter out = new PrintWriter(new File("B-small-attempt1.out"));
		
		int t = in.nextInt();
		in.nextLine();
		
		for(int i=0; i<t; i++) {
			int n = in.nextInt();
			int s = in.nextInt();
			int p = in.nextInt();
			
			int r = 0;
			
			System.out.println("s="+s+", p="+p);
			
			for(int k=0; k<n; k++) {
				int c = in.nextInt();
				
				int v1 = (int)Math.round(c / 3.0);
				int v2 = v1;
				int v3 = c - v1 - v2;
			
				System.out.print(v1+"+"+v2+"+"+ v3 + " = " + c + "\t");
				if (v1>=p || v3>=p) { 
					System.out.println(" >=p");
					r++;
				}
				else {
					if (s>0) {
						if (v1+1>=p && v1-1>=0) {
							System.out.println(" special");
							
							r++;
							s--;
						} else {
							System.out.println(" can't make special");
						}
					} else {
						System.out.println(" no more spec");	
					}
				} 
			}

			System.out.println("------------");
			System.out.println("r=" + r);
			System.out.println("============");

			
			in.nextLine();
			
			out.println("Case #" + (i+1)+ ": " + r);
		}
		out.close();
	}
}
