package com.example;

import java.io.IOException;
import java.util.List;

public class ProblemB {
    
    enum Result {
	INSUFFICIENT,
	SUFFICIENT,
	SUFFICIENT_WHEN_SURPRISING
    }

    public static void main(String[] a) throws IOException {

	List<String> lines = FileUtil.getLines("/B-large.in");
	
	int cases = Integer.valueOf(lines.get(0));
	
	for(int c=0; c<cases; c++) {
	    String[] tokens = lines.get(c+1).split(" ");
	    
	    int n = Integer.valueOf(tokens[0]); // N = number of Googlers
	    int s = Integer.valueOf(tokens[1]); // S = number of surprising triplets
	    int p = Integer.valueOf(tokens[2]); // P = __at least__ a score of P
	    
	    int sumSufficient = 0;
	    int sumSufficientSurprising = 0;
	    
	    for(int i=0; i<n; i++) {
		int points = Integer.valueOf(tokens[3+i]);
		
		switch(test(points, p)) {
		case SUFFICIENT:
		    sumSufficient++;
		    break;
		    
		case SUFFICIENT_WHEN_SURPRISING:
		    sumSufficientSurprising++;
		    break;
		}
		
//		uSystem.out.println("points "+ points +" ? "+ p +" => "+ result);
	    }
	    
	    System.out.println("Case #"+ (c+1) +": "+ (sumSufficient + Math.min(s, sumSufficientSurprising)));
	    
//	    System.out.println();
//	    System.out.println("N="+ n +", S="+ s +", P="+ p);
//	    System.out.println();
	}
    }

    private static Result test(int n, int p) {
	int fac = n / 3;
	int rem = n % 3;
	
	if(rem == 0) {
	    
//	    int triplet0[] = { fac, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac > 0 && fac < 10) {
		
		if(fac+1 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
		
//		int triplet1[] = { fac+1, fac, fac-1 }; // surprising 
//		print(n, triplet1);
	    }
	    
	    
	} else if(rem == 1) {
	    
//	    int triplet0[] = { fac+1, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
//	    if(fac > 0 && fac < 10) {
//		int triplet1[] = { fac+1, fac+1, fac-1 };
//		print(n, triplet1);
//	    }
	    
	} else if(rem == 2) {
	    
//	    int triplet0[] = { fac+1, fac+1, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac < 9) {
//		int triplet1[] = { fac+2, fac, fac }; // surprising
//		print(n, triplet1);

		if(fac+2 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
	    }
	    
	} else {
	    throw new RuntimeException("error");
	}
	
	return Result.INSUFFICIENT;
//	System.out.println();
//	System.out.println(n +" => "+ div3 +" ("+ rem +")");
    }
    
//    private static void print(int n, int[] triplet) {
//	System.out.println("n="+ n +" ("+ (n/3) +","+ (n%3) +") => ["+ triplet[0] +","+ triplet[1] +","+ triplet[2] +"]" + (triplet[0]-triplet[2] > 1 ? " *" : ""));
//    }
    
}


import java.util.Scanner;


public class Dancer{
     private static int t;

     public static void main(String[] args) {
         Scanner in = new Scanner(System.in);
         t=in.nextInt();
         in.nextLine();
//         System.out.println(t+" Cases");
         for (int i=0;i<t;i++){
        	 int n=in.nextInt();
        	 int s=in.nextInt();
        	 int p=in.nextInt();
        	 int t[]=Dancer.getTotalPoints(in,n);
        	 if(in.hasNextLine()){
        		 in.nextLine();
        	 }
        	 int y=Dancer.maxNumGooglers(s,p,t);
             System.out.print("Case #"+(i+1)+": "+y+"\n");
         }
    }

    public static int maxNumGooglers(int s,int p,int []t){
    	int limits[]=calcLimits(p);
//    	System.out.println(limits[0]+"-"+limits[1]);
    	int y=0;    	
    	for(int i=0;i<t.length;i++){
    		if(t[i]==0&&p>0){
    			continue;
    		}
    		if(t[i]>=limits[0]){
    			y++;
    		}
    		else{
    			if(t[i]>=limits[1]&&s>0){
    				s--;
    				y++;
    			}
    		}
    	}
    	return y;
    }
    
    public static int[] calcLimits(int p){
    	int limits[]=new int[2];
    	limits[0]=p+2*(p-1);
    	limits[1]=p+2*(p-2); 
    	if(limits[0]<0){
    		limits[0]=0;
    	} 
    	if(limits[1]<0){
    		limits[1]=0;
    	} 
    	return limits;
    }
    
    
    
    
     public static int[] getTotalPoints(Scanner in,int n){
    	 int[] array=new int[n];
    	 for(int i=0;i<n;i++){
    		 array[i]=in.nextInt();
//    		 System.out.println(array[i]);
    	 }    	 
    	 return array;
     }


}