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.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;


public class q2 {
	public static int calc(int n, int s, int p,ArrayList<Integer> scores) {
		int count = 0;
		int aboveAve = 0;
		for(int i = 0;i < n;i++) {
			if(scores.get(i) >= 3*p) {
				aboveAve ++;
				continue;
			}
			if((scores.get(i) >= (3*p - 2))&&(3*p - 2 >= 0)) {
				aboveAve ++;
			} else {
				if((scores.get(i) >= (3*p - 4))&&(3*p - 4 >= 0)) {
					count ++;
				}
			}
		}
		if(count > s) {
			count = s;
		}
		count = count + aboveAve;
		return count;
	}
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		ArrayList<Integer> scores = new ArrayList<Integer>();
		int p = 0;//at least p
		int s = 0;//surprise
		int n = 0;//n dancers
			try {
			FileReader fr = new FileReader("D:\\B-large.in");
			BufferedReader br = new BufferedReader(fr);
			FileWriter fw = new FileWriter("D:\\y.txt");
			BufferedWriter bw = new BufferedWriter(fw);
			String str = br.readLine();
			int t = Integer.parseInt(str); 
			for(int i = 0;i < t;i++) {
				String data = br.readLine();
				String[] numbers = data.split(" ");
				n = Integer.parseInt(numbers[0]);
				s = Integer.parseInt(numbers[1]);
				p = Integer.parseInt(numbers[2]);
				for(int j = 0;j < n;j++) {
					scores.add(Integer.parseInt(numbers[j + 3]));
				}
				String prefix = "Case #" + (i+1) + ": ";
				System.out.print(prefix + calc(n, s, p, scores) + "\n");
				bw.write(prefix + calc(n, s, p, scores) + "\n");
				scores.clear();
			}
			br.close();
			fr.close();
			bw.close();
			fw.close();
		} catch (Exception e) {
			e.printStackTrace();
		}

	}

}
