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

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}

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


public class B {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner read = new Scanner(new File("B-small-attempt0.in"));
		PrintWriter out = new PrintWriter(new File("b-small.out"));
		int numberOfTests = Integer.parseInt(read.nextLine());
		for (int i = 1; i <= numberOfTests; i++) {
			int result = 0;
			int n = read.nextInt();
			int countSurp = read.nextInt();
			int minScore = read.nextInt();
			int[] totalScores = new int[n];
			for (int j = 0; j < n; j++) {
				totalScores[j] = read.nextInt();
			}
			double[] avg = new double[n];
			for (int j = 0; j < n; j++) {
				avg[j] = totalScores[j] / 3.0;
			}
			for (int j = 0; j < n; j++) {
				if (avg[j] >= minScore) {
					result++;
				} else if (Math.abs(avg[j] - minScore) >= 1.5) {
					continue;
				} else if (Math.abs(avg[j] - Math.round(avg[j])) < 0.3) {
					long t1 = Math.round(avg[j]);
					long t2 = t1;
					long t3 = t2;
					if (countSurp > 0 && t2 >=1) {
						t2--;
						t3++;
						countSurp--;
						result++;
					}
				} else if (avg[j] - Math.round(avg[j]) > 0) {
					long t1 = Math.round(avg[j]);
					long t2 = t1;
					long t3 = t2 + 1;
					if (t3 == minScore) {
						result++;
					}
				} else {
					long t1 = Math.round(avg[j]) - 1;
					long t2 = t1 + 1;
					long t3 = t2;
					if (t3 == minScore) {
						result++;
					} else {
						if (countSurp > 0 && t2 >= 1) {
							countSurp--;
							result++;
							t2--;
							t3++;
						}
					}
				}
			}
			out.println(String.format("Case #%d: %d", i, result));
		}
		out.close();
	}
}
