/*
 * 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.*;
import java.util.ArrayList;
import java.util.List;

public abstract class JamProblem {

    int caseCount;
    int lastLine;

    abstract String solveCase(JamCase jamCase);
    abstract JamCase parseCase(List<String> file, int line);
    List<String> loadFile() throws IOException {
        FileReader inputStream = new FileReader("C:\\projekt\\codejam\\src\\input.txt");
        BufferedReader reader = new BufferedReader(inputStream);
        List<String> list = new ArrayList<String>();
        while (true) {
            String line = reader.readLine();
            if (line == null) {
                break;
            }
            list.add(line);
        }
        return list;
    }

    void go() throws IOException {
        List<String> file = loadFile();


        parseFirstLine(file);
        FileWriter writer = new FileWriter("C:\\projekt\\codejam\\src\\otput.txt");
        for (int c=0; c< caseCount; c++) {
            JamCase casee= parseCase(file, lastLine);
            lastLine += casee.lineCount;
            String s = solveCase(casee);
            writer.write("Case #" + (c+1) +": " + s + "\n");
        }
        writer.close();
    }

    void parseFirstLine(List<String> file) {
        int[] firstLine = JamUtil.parseIntList(file.get(0), 1);
        this.caseCount = firstLine[0];
        lastLine = 1;
    }
}
