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 ? " *" : ""));
//    }
    
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package Codejam2012;

import java.io.*;

/**
 *
 * @author Brian
 */
public class googlers {
        
    public static void main(String [] args) throws FileNotFoundException, IOException{

        String data;
        String printout="";
        String [] output;
        
        int numOfGooglers;
        int numOfSurprising;
        int leastScore;
        int [] scores;
        String [] splitData;
        
        String inputFileName = "C:/input/googlersIn.txt";
        String outputFileName = "C:/input/googlersOut.txt";
        
        BufferedReader reader = new BufferedReader(new FileReader(inputFileName));
        FileWriter out = new FileWriter(outputFileName);
        PrintWriter print = new PrintWriter(out);
        
        data = reader.readLine();
        int size = Integer.parseInt(data);
        output = new String[size];
        data = reader.readLine();
        int k =0;
        while(data!=null){
            
            splitData = data.split("\\s");
            numOfGooglers = Integer.parseInt(splitData[0]);
            numOfSurprising = Integer.parseInt(splitData[1]);
            leastScore = Integer.parseInt(splitData[2]);
            scores = new int[numOfGooglers];
            for(int b=3;b<splitData.length;b++){
                scores[b-3] = Integer.parseInt(splitData[b]);
            }
            int diff = leastScore-2;
            if(diff<0){
                diff = 0;
            }
            int total = 0;
            int greatCount =0; 
            int outSide = 0;
            int obvious = 0;
            int minScore = leastScore + (diff*2);
            int minScore_alt = leastScore + ((leastScore-1)*2);
            if(numOfSurprising==0){
                if(leastScore==1){
                    minScore = 1;
                }
                else{
                    if(leastScore==0){
                        minScore = 0;
                    }
                    else{
                    //minScore += 2;
                    minScore = leastScore + ((leastScore-1)*2);
                    }
                }
                for(int a=0;a<numOfGooglers;a++){
                    if(scores[a] >= minScore){
                        total ++;
                    }
                }
            }
            else{
                for(int a=0;a<numOfGooglers;a++){
                    if(scores[a]>=minScore){
                        greatCount++;
                    }
                    
                    if(scores[a]>=minScore_alt){
                        obvious++;
                    }
                } 
//                for(int a=0;a<numOfGooglers;a++){
//                    if(scores[a]>=2 && scores[a]<minScore){
//                        outSide++;
//                    }
//                }
                if(greatCount-obvious>=numOfSurprising){
                    total = obvious + numOfSurprising;
                }
                else{
                    total = greatCount;
                }
                
              }
            
            output[k++] = String.valueOf(total);                   
            
            data = reader.readLine();
        }
        
        for(int p=0; p<output.length;p++){           
            printout += "Case #"+(p+1)+": "+output[p]+"\n";  
        }
        print.println(printout);
        print.close();
        reader.close();
    }
}
