/**
 * 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();
    }
}

import java.math.BigDecimal;
import java.math.RoundingMode;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class DancingWithGooglers {

    public static void main(String[] args) {
        Scanner problem = new Scanner(System.in);
        int T = problem.nextInt();
        for (int i = 0; i < T; i++) {
            int answer = 0;
            int N = problem.nextInt();
            int S = problem.nextInt();
            int p = problem.nextInt();
            List<Triplet> googlers = new ArrayList<Triplet>();
            for (int j = 0; j < N; j++) {
                googlers.add(new Triplet(problem.nextInt()));
            }
            int possibleSurprises = 0;
            for (Triplet triplet : googlers) {
                if (triplet.minMax() >= p) {
                    answer++;
                    continue;
                }
                if (triplet.maxMax() >= p) {
                    possibleSurprises++;
                }
            }
            answer += possibleSurprises >= S ? S : possibleSurprises;
            System.out.println(String.format("Case #%s: %s", i + 1, answer));
        }
    }

}

class Triplet {

    private int totalScore;

    public Triplet(int totalScore) {
        this.totalScore = totalScore;
    }
    
    private int min() {
        return new BigDecimal(totalScore).divide(new BigDecimal(3), RoundingMode.FLOOR).intValue();
    }

    public int minMax() {
        return new BigDecimal(totalScore).divide(new BigDecimal(3), RoundingMode.CEILING).intValue();
    }

    public int maxMax() {
        int lalala = this.totalScore % 3;
        if (lalala == 0) {
            lalala = 1;
        }
        if (this.totalScore == 0) {
            lalala = 0;
        }
        return this.min() + lalala;
    }
}
