/**
 * Created by IntelliJ IDEA.
 * User: Administrator
 * Date: 3/3/12
 * Time: 11:00 AM
 * To change this template use File | Settings | File Templates.
 */

import SRMLib.MathLibrary;
import SRMLib.TestSRMLib;
import com.sun.org.apache.bcel.internal.generic.F2D;

import java.io.*;
import java.util.*;
import java.util.zip.Inflater;

public class SRM {
    public static void main(String[] args) throws IOException {
        //TestSRMLib.run();
        codeJam1.main();

        return;
    }
}
class codeJam1 {
    public static void main() throws IOException {
        String inputPath = "E:\\input.txt";
        String outputPath = "E:\\output.txt";
        BufferedReader input = new BufferedReader(new FileReader(inputPath));
        BufferedWriter output = new BufferedWriter(new FileWriter(outputPath));

        String line;
        line = input.readLine();
        int T = Integer.parseInt(line);
        for (int i = 1; i <= T; ++i) {
            line = input.readLine();
            String[] words = line.split(" ");
            int N = Integer.parseInt(words[0]);
            int S = Integer.parseInt(words[1]);
            int p = Integer.parseInt(words[2]);
            int n = 0;
            int res = 0;

            for (int j = 3; j < words.length; ++j) {
                if (p == 0) {
                    res++;
                    continue;
                }

                int t = Integer.parseInt(words[j]);
                if (p == 1) {
                    if (t > 0)
                        res++;
                    continue;
                }
                if (t >= 3 * p - 2)
                    res++;
                else if (t >= 3 * p - 4)
                    n++;
            }

            res += Math.min(n, S);
            output.write("Case #" + i + ": " + res);
            output.newLine();
        }

        input.close();
        output.close();
    }
}

/*******************************************************************************
 * Copyright (c) 2012 by Institute of Computing Technology,
 * 		Chinese Academic of Sciences, Beijing, China.
 *
 * 	Author: Ruijian Wang
 * 	  File: B.java
 * 	  Date: 2012-04-14
 * 	  Time: 13:29:55
 ******************************************************************************/

package gcj12;

import java.util.Scanner;

/**
 * Todo.
 * <p/>
 * User: Ruijian Wang
 * Date: 4/14/12
 * Time: 1:29 PM
 *
 * @author Ruijian Wang<br>
 * @version 1.0.0 2012-04-14<br>
 */
public class B {
    void solve() {
        int tCase, n, s, p;
        Scanner scan = new Scanner(System.in);
        tCase=scan.nextInt();
        for (int i = 1; i <= tCase; i++) {
            int num = 0;
            n = scan.nextInt();
            s = scan.nextInt();
            p = scan.nextInt();
            int t;
            for (int j = 0; j < n; j++) {
                t = scan.nextInt();
                int m = t % 3;
                int max = -1;
                if (m == 1) {
                    max = t / 3 + 1;
                    if (max >= p) {
                        num ++;
                    }
                } else if (m == 2) {
                    max = t / 3 + 1;
                    if (max >= p) {
                        num ++;
                    } else if (s > 0 && max + 1 >= p) {
                        s--;
                        num++;
                    }
                } else {
                    max = t / 3;
                    if (max >= p) {
                        num++;
                    } else if (s > 0 && t >= 3 && max + 1 >= p) {
                        s--;
                        num++;
                    }
                }
            }
            System.out.println("Case #" + i + ": " + num);
        }
    }

    public static void main(String[] args) {
        new B().solve();
    }
}
