/*
 * 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.PrintWriter;

import java.util.HashSet;
import java.util.Scanner;

/**
 * User: Sasha
 * Date: 09.04.12
 * Time: 19:13
 */
public class Main {
    private Scanner sc;
    private PrintWriter wr;
    private HashSet<String> set;

    private void prepare() throws Exception {
        sc = new Scanner(new File("C:\\Projects\\B-small-attempt2.in"));
        File file = new File("C:\\Projects\\out.txt");
        wr = new PrintWriter(file);
//        wr = new PrintWriter(System.out);
    }
    
    private void solve() {
        int T = sc.nextInt();

        for (int i = 0; i < T; ++i) {
            set = new HashSet<String>();

            wr.print(String.format("Case #%d: ", (i + 1)));

            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();

            int r[] = new int[n];
            for (int j = 0; j < r.length; ++j)
                r[j] = sc.nextInt();
            
            int res = 0;
            
            for (int j = 0; j < n; ++j) {
                int e = r[j] / 3;
                int k = r[j] - e * 3;
                
                if (e >= p) {
                    ++res;
                } else if (k >= 1 && e + 1 >= p) {
                    ++res;
                } else if (k == 0 && e + 1 >= p && s > 0 && e > 0) {
                    ++res;
                    --s;
                }
                else if (k == 2 && e + 2 >= p && s > 0) {
                    ++res;
                    --s;
                }

            }
            wr.println(res);
        }

        wr.flush();
    }

    public static void main(String args[]) throws Exception {
        Main main = new Main();
        
        main.prepare();
        
        main.solve();
    }
}
