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;
    }
}


package WQ;

import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;

public class Problem_B {

	/**
	 * @param args
	 * @throws FileNotFoundException
	 */
	public static void main(String[] args) throws FileNotFoundException {
		String filename = "B-large (1).in";
		Scanner s = new Scanner(new FileReader(filename));
		PrintWriter out = new PrintWriter("out.txt");
		int num = s.nextInt();
		for (int CASE = 1; CASE <= num; CASE++) {
			int n = s.nextInt();
			int sr = s.nextInt();
			int p = s.nextInt();
			int[] compet = new int[n];
			for (int i = 0; i < n; i++) {
				compet[i] = s.nextInt();
			}
			int count = 0;
			for (int i = 0; i < compet.length; i++) {
				int divide = compet[i] / 3;
				int rem = compet[i] % 3;
				if (divide >= p)
					count++;
				else {
					if (rem == 0 && sr > 0 && divide > 0 && divide + 1 >= p) {
						count++;
						sr--;
					} else if (rem == 1 && divide + 1 >= p) {
						count++;
					} else if (rem == 2) {
						if (divide + 1 >= p)
							count++;
						else if (sr > 0 && divide + 2 >= p) {
							count++;
							sr--;
						}
					}
				}
			}
			out.println("Case #" + CASE + ": " + count);
		}
		out.close();
	}
}
