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

package com.spelchec.codejam.project2;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;

public class Main {
	public static void main (String[] args) throws IOException {
		final String outputTemplate = "Case #%d: %d\n";		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		int run = Integer.parseInt(br.readLine());
		for (int r = 1; r <= run; r++) {
			Scanner scan = new Scanner(br.readLine());
			int N = scan.nextInt();
			int S = scan.nextInt();
			int p = scan.nextInt();
			int[] results = new int[N];
			for (int i = 0; i < N; i++) {				
				results[i] = scan.nextInt();
			}
			System.out.print(String.format(outputTemplate, r, solve(N, S, p, results)));
		}
	}

	private static int solve(int N, int S, int p, int[] results) {
		int count = 0;
		
		for (int i = 0; i < results.length; i++) {
			int r = results[i];
			int threshold = p*3-2;
			if (r >= threshold) {
				count++;
			} else if (S > 0 && r >= threshold - 2 && r >= 2) {
				count++; S--;
			}
		}
				
		return count;
	}
}
 