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.IOException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

public class Dancing {

	public static void main(String[] args) throws IOException{
		Scanner sc = new Scanner(new File("dancing.in"));
		System.setOut(new PrintStream(new File("dancing.out")));
		ArrayList<Googler> changeAble = new ArrayList<Googler>(100);
		int t = sc.nextInt();
		for(int i=1; i<=t; i++){
			changeAble.clear();
			int n = sc.nextInt();//number of googlers
			int s = sc.nextInt();//number of surprises
			int p = sc.nextInt();//target
			int y = 0;//number that match
			for(int j=0; j<n; j++){
				Googler temp = new Googler(sc.nextInt(),p);
				if(temp.distAway < 1)
					y++;
				else if(temp.changeAble){
					changeAble.add(temp);
				}
			}
			Collections.sort(changeAble);
			for(int j=0; j<s && j<changeAble.size(); j++){
				Googler temp = changeAble.get(j);
				if(temp.maxScore+1 < p)
					break;
				y++;
			}
			System.out.println("Case #"+i+": "+y);
		}

	}

}
class Googler implements Comparable<Googler>{
	int distAway;
	boolean changeAble = false;
	int maxScore;
	int sScore;
	int score;
	int t;
	public Googler(int score, int target){
		t = target;
		this.score=score;
		int i = score/3;
		if(i*3==score){
			maxScore = i;
			changeAble = true;
		}
		else if(i*2+i+1 == score)
			maxScore = i+1;
		else if(i+(i+1)*2==score){
			maxScore = i+1;
			changeAble = true;
		}
		if(maxScore==0)
			changeAble = false;
		distAway = target-maxScore;
	}
	public int compareTo(Googler g){
		return distAway-g.distAway;
	}
	public String toString(){
		return score+"";
	}
}
