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

public class Dancing_With_the_Googlers {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int T = 0;
		while (scanner.hasNextInt()) {
			T = scanner.nextInt();
			break;
		}

		for (int t = 0; t <= T; t++) {
			if (scanner.hasNextLine()) {
				String line = scanner.nextLine();
				if (!line.isEmpty()) {
					String[] g = line.split(" ");
					int N = Integer.parseInt(g[0]);
					int s = Integer.parseInt(g[1]);
					int p = Integer.parseInt(g[2]);

					int minS = p + (p - 2) + (p - 2);
					int noS = p + (p - 2) + (p - 2) + 2;

					int output = 0;
					int total = 0;

					for (int i = 3; i <= N + 2; i++) {
						if (Integer.parseInt(g[i]) >= noS) {
							output++;
						} else if (Integer.parseInt(g[i]) < noS && Integer.parseInt(g[i]) >= minS) {
							if(Integer.parseInt(g[i])==0){
								continue;
							}
							total++;
						}
					}
					if (total == s) {
						output += total;
					} 
					else if(s==0){
						
					}else if (total >=s) {
						if(output==0)
							output=s;
						else
							output += (total - s);
					}else if (total <s) {
						output += total;
					}
					System.out.println("Case #" + (t) + ": " + output);
				}
			}
		}

	}

}
