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.FileReader;
import java.io.IOException;
import java.util.StringTokenizer;


public class DancingGogglers {
	static class Data{
		int n,surprise,max;
		int score [][];
		
		int getNumberofNonMax(){
			int max = 0;
			for(int i = 0 ; i < score.length; i++){
				if(score[i][1] ==0 && score[i][0] >=2)
					max++;
			}
			return max;
		}
		int getNumberOfMax(){
			int max = 0;
			for(int i = 0 ; i < score.length; i++){
				if(score[i][1] ==1)
					max++;
			}
			return max;
		}
		int getNumberofMaxWithOnlySurprise(){
			int max = 0;
			for(int i = 0 ; i < score.length; i++){
				if(score[i][2] ==1)
					max++;
			}
			return max;
		}
		int getSolution (){
			int initMax = getNumberOfMax();
			if(getNumberofMaxWithOnlySurprise() > surprise){
				return (initMax - (getNumberofMaxWithOnlySurprise() - surprise ));
			}
			if(getNumberofNonMax() >= surprise){
				return getNumberOfMax();
			}
			return initMax;
		}
	}
	
	public static void main(String[] args) {
		Data[] data = getData();
		for(int i = 0 ; i < data.length; i++){
			int index = i+1;
//			System.out.print("Case #" + index + ": " + data[i].n + " "+ data[i].surprise + " "  + data[i].max + " ");
//			for(int score[] : data[i].score){
//				System.out.print(score[0] + " ");
//			}
			System.out.println("Case #" + index + ": " + data[i].getSolution());
		}
			
		
	}

	private static Data[] getData() {
		try {
			String[] input = getInput("B-large.in");
			Data [] data = new Data[input.length];
			
			for(int i = 0 ; i < input.length; i++){
				Data d = new Data();
				StringTokenizer token = new StringTokenizer(input[i], " ");
				d.n = Integer.parseInt((String) token.nextElement());
				d.surprise = Integer.parseInt((String) token.nextElement());
				d.max = Integer.parseInt((String) token.nextElement());
				d.score = new int[d.n][1+1+1];
				for(int j = 0 ; j < d.n; j++){
					d.score[j][0] = Integer.parseInt((String) token.nextElement());
					if(d.score[j][0] < d.max) continue;
					if((d.score[j][0] == 0 && d.max == 0)|| (d.score[j][0] >= (3*d.max -4) && (d.score[j][0]!=0)) ){
						d.score[j][1] = 1;
						if((d.score[j][0] == 3*d.max-4) ||
								(d.score[j][0] == 3*d.max-3)){
							d.score[j][2] =1;
						}
					}
				}
				data[i] = d;
			}
			return data;
		} catch (IOException e) {
			e.printStackTrace();
		}
		return null;
		
	}
	
	static String[] getInput(String fileName) throws IOException {
		BufferedReader reader = new BufferedReader(new FileReader(fileName));
		try {
			String message = reader.readLine();
			int numberOfTestCases = Integer.parseInt(message);
			String[] input = new String[numberOfTestCases];
			for (int i = 0; i < numberOfTestCases; i++) {
				message = reader.readLine();
				input[i] = message;
			}
			return input;
		} finally {
			reader.close();
		}
	}
}
