import java.util.List;


public class Case implements Runnable {

	private int id;
	private String output;

	private int n;
	private int s;
	private int p;
	private List<Integer> g;

	public Case(int id) {
		this.id = id;
	}

	public Case(int id, int n, int s, int p, List<Integer> g) {
		super();
		this.id = id;
		this.n = n;
		this.s = s;
		this.p = p;
		this.g = g;
	}

	public String solve() {
		int res = 0;
		for (int googler : g) {
			int b = googler / 3;
			boolean div = googler % 3 == 0;
			if (b >= p) {
				res++;
				continue;
			}
			if (p == b+1) {
				if (div && s > 0 && b > 0) {
					res++;
					s--;
					continue;
				}
				if (!div) {
					res++;
					continue;
				}
			}
			if (p == b+2) {
				if (3*b+2 == googler && s > 0) {
					res++;
					s--;
				}
			}
		}
		return String.valueOf(res);
	}

	@Override
	public void run() {
		output = solve();
	}

	@Override
	public String toString() {
		return "Case #" + id + ": " + output;
	}

}
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.*;

public class Main
{
    public static void main(String[] args)
            throws Exception
    {
        BufferedReader in = new BufferedReader(new FileReader(args[0]));
        FileWriter out = new FileWriter(args[1]);
        int T = Integer.parseInt(in.readLine());

        for (int t = 1; t <= T; t++)
        {
            String data[] = in.readLine().split("\\ ");
            int N = Integer.parseInt(data[0]);
            int S = Integer.parseInt(data[1]);
            int p = Integer.parseInt(data[2]);
            int[] totalPoints = new int[N];
            for (int i = 0; i < N; i++)
                totalPoints[i] = Integer.parseInt(data[i + 3]);

            int unconditionalSucc = 0;
            int failed = 0;

            int upperLimit;
            int lowerLimit;

            if (p >= 2)
            {
                upperLimit = 3 * p - 3;
                lowerLimit = 3 * p - 4;
            }
            else if (p == 1)
            {
                upperLimit = 0;
                lowerLimit = 1;
            }
            else
            {
                upperLimit = -1;
                lowerLimit = -1;
            }

            for (int i = 0; i < totalPoints.length; i++)
            {
                if (totalPoints[i] > upperLimit)
                    unconditionalSucc++;
                else if (totalPoints[i] < lowerLimit)
                    failed++;
            }

            int uncertain = N - failed - unconditionalSucc;

            out.write("Case #" + t + ": " + (Math.min(uncertain, S) + unconditionalSucc) + "\n");
        }

        in.close();
        out.close();
    }
}
