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.*;

public class ProblemB {
	public static void main(String[] args) {
		System.out.println("Enter input for case:");
		
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		sc.nextLine();
		
		int[] nt = new int[T];
		int[] st = new int[T];
		int[] pt = new int[T];
		int[][] ni = new int[T][];
		for (int t = 0; t < T; t++) {
			nt[t] = sc.nextInt();
			st[t] = sc.nextInt();
			pt[t] = sc.nextInt();
			ni[t] = new int[nt[t]];
			for (int j = 0; j < nt[t]; j++)
				ni[t][j] = sc.nextInt();
			sc.nextLine();
		}
		
		
		for (int t = 1; t <= T; t++) {
			int n = nt[t-1]; //number of Googlers
			int s = st[t-1]; //number of surprising triplets of scores
			int p = pt[t-1]; //minimum best result
			int sUsedUp = 0;
			int result = 0;
			
			for (int totalPoints : ni[t-1]) {
				if (totalPoints >= p*3 - 2)
					result++;
				if (p > 1)
					if (totalPoints == p*3 - 4 || totalPoints == p*3 - 3)
						if (sUsedUp < s) {
							result++;
							sUsedUp++;
						}
			}
			
			System.out.println("Case #" + t +": " + result);
		}
		
		

	}

}
