import java.io.*;
import java.math.*;
import java.util.*;
import java.text.*;

public class b {
    public static void main(String[] args) {
        Scanner sc = new Scanner(new BufferedInputStream(System.in));

        int T = sc.nextInt();

        for (int casenumber = 1; casenumber <= T; ++casenumber) {

            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();

            int[] ts = new int[n];
            for (int i = 0; i < n; ++i)
                ts[i] = sc.nextInt();

            int thresh1 = (p == 1 ? 1 : (3 * p - 4));
            int thresh2 = (3 * p - 2);

            int count1 = 0, count2 = 0;

            for (int i = 0; i < n; ++i) {
                if (ts[i] >= thresh2) {
                    ++count2;
                    continue;
                }
                if (ts[i] >= thresh1) {
                    ++count1;
                }
            }

            if (count1 > s) {
                count1 = s;
            }

            System.out.format("Case #%d: %d%n", casenumber, count1 + count2);
        }
    }
}

import java.util.Scanner;

public class B {
	public static void main(String args[]) {
		new B();
	}

	public B() {
		Scanner in = new Scanner(System.in);

		int T = in.nextInt();
		for(int t=1; t<=T; t++) {
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();

			int y = 0;
			for(int n=0; n<N; n++) {
				int ti = in.nextInt();

				int r = ti - p;
				if(r < 0) continue;

				int a = r / 2;
				int b = r - a;

				int da = a - p;
				int db = b - p;
				int d = Math.min(da, db);
				if(d == -2) {
					if(S > 0) S--;
					else continue;
				}

				if(d >= -2) y++;
			}
			System.out.printf("Case #%d: %d\n", t, y);
		}
	}
}