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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.Map;


public class DancingWithThegooglers {


	private static Map<Integer, Points> pointMap = new HashMap<Integer, Points>();
	public static void main(String[] args) {
		
		pointMap.put(0, new Points(0, 0));
		pointMap.put(1, new Points(1, 1));
		pointMap.put(2, new Points(4, 2));
		pointMap.put(3, new Points(7, 5));
		pointMap.put(4, new Points(10, 8));
		pointMap.put(5, new Points(13, 11));
		pointMap.put(6, new Points(16, 14));
		pointMap.put(7, new Points( 19, 17));
		pointMap.put(8, new Points( 22, 20));
		pointMap.put(9, new Points( 25, 23));
		pointMap.put(10, new Points( 28, 26));
		try {
		    BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		    String str = "";
		    
		    // Testcases
		    str = in.readLine();
		    int cases = Integer.valueOf(str);
		    List<String> output = new ArrayList<String>();
		    
		   for(int i = 1; i <= cases; i++){
		        
		        str = in.readLine();
		        
		        String[] numbers = str.split(" ");
		        
		        int googlers = Integer.valueOf(numbers[0]);
		        int surprising = Integer.valueOf(numbers[1]);
		        int points = Integer.valueOf(numbers[2]);
		        
		        Integer[] results = new Integer[googlers];
		        
		        
		        for(int j = 3; j < 3 + googlers; j++){
		        	results[j - 3] = Integer.valueOf(numbers[j]); 
		        }
		        
		     // sort the shit out of it
		        Arrays.sort(results, Collections.reverseOrder());
		        
		        
		        output.add("Case #" + i+ ": " + calculate(googlers, surprising, points, results));
		    }
		   
		       for(String outputLine : output){
		        System.out.println(outputLine);
		    }
		       
		} catch (IOException e) {
		}

	}

	private static String calculate(int googlers, int surprising, int points,
			Integer[] results) {
		String res = googlers + " : " + surprising + " : " + points + " anz: " + results.length + " first: " + results[0] + " last: " + results[results.length - 1];
		
		Points p = pointMap.get(points);
		int result = 0;
		int surleft = surprising;
		for(int i = 0; i < results.length; i++){
			if(results[i] >= p.minPoints){
				result++;
				continue;
			}
			if(results[i] >= p.surPoints && surleft > 0) {
				result++;
				surleft--;
				continue;
			}
			break;
		}
		return String.valueOf(result);
	}

}
