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 problemB;

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Scanner;

public class Main {

	private Scanner scanner;
	private PrintWriter writer;

	public Main(InputStream is, OutputStream os) {
		scanner = new Scanner(is);
		writer = new PrintWriter(os);
	}

	public void solve() {
		
		// Unit Tests:
		int tmp;
		int tmp1[] = {15,13,11};
		if (calculate(1, 5, tmp1)!=3) return;
		int tmp2[] = {23,22,21};
		if (calculate(0, 8, tmp2)!=2) return;
		int tmp3[] = {8,0};
		if (calculate(1, 1, tmp3)!=1) return;
		int tmp4[] = {29,20,8,18,18,21};
		if (calculate(2, 8, tmp4)!=3) return;
		
		for (int i=0; i<200; i++)
			System.out.println("");

		int cases = scanner.nextInt();

		for (int i = 1; i <= cases; i++) {
			writer.print("Case #");
			writer.print(i + ": ");

			scanner.nextLine();
			int n = scanner.nextInt(); // number of Googlers
			int s = scanner.nextInt(); // number of surprising triplets
			int p = scanner.nextInt(); // minimum score
			int t[] = new int[n];
			for (int j = 0; j < n; j++)
				t[j] = scanner.nextInt();

			System.out.println(i + ": MinScore=" + p + ", Surprising Triplets=" + s);
			int result = calculate(s, p, t);

			writer.println(result);
			System.out.println(" -> " + result);
			System.out.println("-------------");
		}
		writer.flush();
	}

	private int calculate(int noSurprisingScores,
			int minimumScore, int[] scores) {
		int result = 0;

		for (int score : scores) {
			int triplet[] = new int[3];
			System.out.print(score + ": ");
			switch (score % 3) {
			case 0:
				if (score / 3 >= minimumScore) {
					result++;
					//System.out.println((score / 3) + "," + (score / 3) + "," + (score / 3));
				} else {
					if (noSurprisingScores > 0)
						if (score / 3 + 1 >= minimumScore && score / 3 - 1 >= 0) {
							result++;
							noSurprisingScores--;
							System.out.println((score / 3 - 1) + "," + (score / 3) + "," + (score / 3 + 1) + " *");
						}
				}
				break;
			case 1:
				if ((score-1)/3 + 1 >= minimumScore) {
					result++;
					//System.out.println((score-1)/3 + "," + ((score-1)/3) + "," + ((score-1)/3 + 1));
				} else {
					// Surprising Triplet führt nicht zur Erhöhung des max Scores
				}
				break;
			case 2:
				if ((score-2)/3 + 1 >= minimumScore) {
					result++;
					//System.out.println((score-2)/3 + "," + ((score-2)/3 + 1) + "," + ((score-2)/3 + 1));
				} else {
					if (noSurprisingScores > 0)
						if ((score - 2) / 3 + 2 >= minimumScore) {
							result++;
							noSurprisingScores--;
							//System.out.println((score-2)/3 + "," + (score-2)/3 + "," + ((score-2)/3 + 2) + " *");
						}
				}
				break;
			}

		}

		return result;
	}

	/*
	 * private boolean exceedsMinumumScore(int[] triplet, int minScore) { for
	 * (int i=0; i<3; i++) if (triplet[i] >= minScore) return true; return
	 * false; }
	 */

	public static void main(String[] args) {
		try {
			InputStream is = new FileInputStream("input/B-large.in");
			OutputStream os = new FileOutputStream("output/B-large.out");
			Main problem = new Main(is, os);
			problem.solve();
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}

		//System.out.println("finished");
	}
}
