/*
 * 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.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.nio.Buffer;
import java.util.Arrays;
import java.util.Scanner;

public class DancingWithGooglers {

    public static void main(String[] args) throws Exception {
        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter("/home/xnike/Downloads/B-small-attempt0.out"));
        Scanner scanner = new Scanner(new File("/home/xnike/Downloads/B-small-attempt0.in"));

        int t = scanner.nextInt();
        scanner.nextLine();

        for (int i = 0; i < t; i++) {
            int n = scanner.nextInt(), s = scanner.nextInt(), p = scanner.nextInt();
            int[] ti = new int[n];

            for (int j = 0; j < n; j++) {
                ti[j] = scanner.nextInt();
            }
            scanner.nextLine();

            Arrays.sort(ti);

            int num = 0;
            for (int k = ti.length - 1; k > -1; k--) {
                int min = ti[k] / 3, max = ti[k] - 2 * (ti[k] / 3);

                if (0 == max - min && 2 < ti[k]) {
                    max++;
                    min--;
                }

                if (max >= p) {
                    if (max == p && (2 == max - min)) {
                        if (0 < s) {
                            s--;
                            num++;
                        }
                    } else {
                    num++;
                    }
                }
            }

            bufferedWriter.write("Case #" + (i + 1)  + ": " + num + "\n");
        }

        bufferedWriter.flush();
    }
}
