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

package world2012.qualification;

import java.io.File;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.Scanner;

public class B {

	public static boolean canPass(int[] t, int p) {
		if (t[0] < 0 || t[1] < 0 || t[2] < 0)
			return false;
		return t[0] >= p || t[1] >= p || t[2] >= p; 
	}

	public static int maxGooglers(int[] scores, int p, int s) {
		B b = new B();
		Triple[] ts = new Triple[scores.length];
		for (int i = 0; i < scores.length; i++) {
			ts[i] = b.new Triple(scores[i]);
		}
		
		int count = 0;
		int surpr = 0;
		for (Triple t : ts) {
			if (canPass(t.triple, p))
				count++;
			else if (canPass(t.sTriple, p))
				surpr++;
		}
		
		return count + Math.min(surpr, s);
	}
	
	static PrintWriter out;

	public static void parseInput() throws Exception {
//		String file = "world2012/qualification/B-large-attempt0.in";
		String file = "world2012/qualification/B-large.in";
//		String file = "input.in";
		Scanner scanner = new Scanner(new File(file));
		out = new PrintWriter(new FileWriter((file.replaceAll(".in", ""))));
		
		int T = Integer.parseInt(scanner.nextLine());
		
		for (int i = 0; i < T; i++) {
			String[] in = scanner.nextLine().split("\\s");
			int N = Integer.parseInt(in[0]);
			int S = Integer.parseInt(in[1]);
			int P = Integer.parseInt(in[2]);
			int[] scores = new int[N];
			for (int j = 0; j < N; j++) {
				scores[j] = Integer.parseInt(in[j + 3]);
			}
			
			int r = maxGooglers(scores, P, S);
			out.println("Case #"+(i+1)+": "+r+"");
		}
	}
	
	public static void main(String[] args) throws Exception {
		parseInput();
		out.close();
		System.out.println("Done!");
	}

	class Triple {
		
		int[] triple;
		int[] sTriple;
		int score;
		
		public Triple(int score) {
			this.score = score;
			init();
		}
		
		private void init() {
			if (score % 3 == 2) {
				int l = score / 3;
				int b = score / 3 + 1;
				triple = new int[] {b, b, l};
				sTriple = new int[] {b + 1, b - 1, l};
			} else if (score % 3 == 1) {
				int l = score / 3;
				int b = score / 3 + 1;
				triple = new int[] {b, l, l};
				sTriple = new int[] {b, b, l - 1};
			} else {
				int l = score / 3;
				triple = new int[] {l, l, l};
				sTriple = new int[] {l + 1, l, l - 1};
			}
		}
	}

}
