/*
 * 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.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;

public class MainClass {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(new File("B-small-attempt1.in"));
		PrintWriter out = new PrintWriter(new File("Dancing-small.out"));

		int T = sc.nextInt();
		for (int i = 0; i < T; i++) {
			int ans = 0;

			int N = sc.nextInt(), S = sc.nextInt(), p = sc.nextInt();
			ArrayList<Integer> sums = new ArrayList<Integer>();
			for (int j = 0; j < N; j++) {
				sums.add(sc.nextInt());
			}
			for (int j = 0; j < N; j++) {
				int tempP = p;

				int sum = sums.get(j);
				int sumBackup = sum;
				while (tempP <= 10 && tempP <= sumBackup) {
					sum = sums.get(j);
					sum -= tempP;
					int half = sum / 2;
					int half2 = sum - half;

					if ((Math.abs(half2 - half) <= 1)
							&& (Math.abs(half2 - tempP) <= 1)
							&& (Math.abs(tempP - half) <= 1)) {
						ans++;
						int test = sums.remove(j);
						// System.out.println(test + "\t " + tempP + "\t" + half
						// + "\t" + half2);
						j--;
						N--;
						break;
					}
					tempP++;

				}

			}
			// System.out.println(S);
			outer: for (int j = 0; j < N; j++) {
				int tempP = p;

				int sum = sums.get(j);
				int sumBackup = sum;
				while (tempP <= 10 && tempP <= sumBackup) {
					sum = sums.get(j);
					sum -= tempP;
					int half = sum / 2;
					int half2 = sum - half;
					if ((Math.abs(half2 - half) <= 2)
							&& (Math.abs(half2 - tempP) <= 2)
							&& Math.abs(tempP - half) <= 2) {
						if (S != 0) {

							ans++;
							S--;

							int test = sums.remove(j);
							// System.out.println(test + "\t " + tempP + "\t"
							// + half + "\t" + half2 + "\t" + S);

							j--;
							N--;
							break;
						}
						if (S == 0) {
							// System.out.println("broke");
							break outer;
						}
					}
					tempP++;

				}

			}
			/* System.out.println(sums); */
			out.println("Case #" + (i + 1) + ": " + ans);
		}
		out.close();

	}
}
