import java.util.*;

public class B {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        B th = new B();
        for (int i = 0; i < T; i++) {
            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();
            int[] t = new int[n];
            for (int j = 0; j < n; j++) {
                t[j] = sc.nextInt();
            }
            int c = th.getAnswer(s,p,t);
            System.out.println("Case #" + (i+1) + ": " + c);
        }
    }
    public int getAnswer(int s, int p, int[] t) {
        int A1 = p + p-1+p-1;
        int A2 = p + p-2+p-2;
        if (A1 < 0)
            A1 = 0;
        if (A2 < 0)
            A2 = 1;
        int remain = s;
        int count = 0;
        int n = t.length;
        for (int i = 0; i < n; i++) {
            if (t[i] >= A1) {
                count++;
            } else if (t[i] < A1 && t[i] >= A2) {
                if (remain > 0) {
                    remain--;
                    count++;
                }
            }
        }
        return count;
    }
}


import java.io.BufferedReader;
import java.io.IOException;
import java.io.PrintWriter;

class Factory implements TestCaseFactory {

	@Override
	public TestCase getInstance(int number) {
		return new DancingWithGooglers(number);
	}
}

public class DancingWithGooglers extends TestCase {

	int caseItem;

	int ngooglers;
	int[] scores;
	int surprising;
	int target;

	int max;

	public DancingWithGooglers(int caseItem) {
		this.caseItem = caseItem;
	}

	@Override
	public void readInput(BufferedReader in) throws IOException,
			MalformedInputFileException {
		final String str1 = in.readLine();
		final String[] tokens = str1.split("\\s");
		ngooglers = Integer.parseInt(tokens[0]);
		surprising = Integer.parseInt(tokens[1]);
		target = Integer.parseInt(tokens[2]);
		scores = new int[ngooglers];
		for (int i = 0; i < ngooglers; i++) {
			scores[i] = Integer.parseInt(tokens[i + 3]);
		}
	}

	private int guaranteedMax(int googler) {
		if (scores[googler] == 0) {
			return 0;
		} else {
			return (scores[googler] - 1) / 3 + 1;
		}
	}

	private int higherScores(int googler) {
		if (scores[googler] == 3) {
			return 0;
		} else {
			return (scores[googler] - 1) % 3 + 1;
		}
	}

	@Override
	public void solve() {
		int guaranteed = 0;
		int marginal = 0;
		for (int googler = 0; googler < ngooglers; googler++) {
			final int guaranteedMax = guaranteedMax(googler);
			if (guaranteedMax >= target) {
				guaranteed++;
			} else if (guaranteedMax == target - 1
					&& higherScores(googler) >= 2 && scores[googler] > 0) {
				marginal++;
			}
		}
		max = guaranteed + Math.min(marginal, surprising);
	}

	@Override
	public void writeOutput(PrintWriter out) {
		out.print("Case #" + (caseItem + 1) + ": ");
		out.print(max);
		out.print("\n");

	}

	public static void main(String[] args) throws IOException,
			MalformedInputFileException {
		new Processor().process(new Factory(), args[0], args[1]);
	}
}