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.ArrayList;
import java.util.Scanner;


public class GooglersDancing {
	
	public static int[][] array = new int[11][4];
	
	public void generateArray() {
		for (int i=0;i<=10; i++) {
			array[i][0] = Integer.MAX_VALUE;
			array[i][2] = Integer.MAX_VALUE;
			array[i][1] = Integer.MIN_VALUE;
			array[i][3] = Integer.MIN_VALUE;
			//ArrayList<Integer> possibleList = new ArrayList<Integer>();
			for (int j=i-2; j<=i+2 ; j++) {
				if (j>=0 && j<=10) {
					if (Math.abs(j-i) < 2) {
						if (array[i][2] > (j+j)) {
							array[i][2] = j+j;
						}
						else if (array[i][3] < (j+j)) {
							array[i][3] = j+j;
						}
						if (array[i][0] > (j+j)) {
							array[i][0] = j+j;
						}
						else if (array[i][1] < (j+j)) {
							array[i][1] = j+j;
						}
					}
					else {
						if (array[i][0] > (j+j)) {
							array[i][0] = j+j;
						}
						else if (array[i][1] < (j+j)) {
							array[i][1] = j+j;
						}
					}
				}
			}
		}
	}
	
	public static void main(String[] args) {
		GooglersDancing g = new GooglersDancing();
		g.generateArray();
		for (int i=0; i<=10; i++) {
			System.out.println(i + ":" + array[i][0] + "*" + array[i][1] + "*" + array[i][2] + "*" + array[i][3] + "*");
		}
		
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		int cases=1;
		while (cases <= T) {			
			int N,S,p, count=0;
			N = in.nextInt();
			S = in.nextInt();
			p = in.nextInt();
			while (N-->0) {
				boolean inRange=false, outRange=false;
				int t = in.nextInt();
				int p2 = p;
				while (p2<=10) {
					int sum = t-p2;
					if (sum >= array[p2][2] && sum <= array[p2][3]) {
						inRange = true;
						break;
					}
					else if (sum >= array[p2][0] && sum <= array[p2][1]) {
						outRange = true;
					}
					p2++;
				}
				if (inRange) {
					count++;
				}
				else if (outRange && S>0) {
					count++;
					S--;
				}
			}
			System.out.println("Case #" + cases + ": " + count);
			cases++;
		}
	}

}
