/**
 * Created by IntelliJ IDEA.
 * User: Administrator
 * Date: 3/3/12
 * Time: 11:00 AM
 * To change this template use File | Settings | File Templates.
 */

import SRMLib.MathLibrary;
import SRMLib.TestSRMLib;
import com.sun.org.apache.bcel.internal.generic.F2D;

import java.io.*;
import java.util.*;
import java.util.zip.Inflater;

public class SRM {
    public static void main(String[] args) throws IOException {
        //TestSRMLib.run();
        codeJam1.main();

        return;
    }
}
class codeJam1 {
    public static void main() throws IOException {
        String inputPath = "E:\\input.txt";
        String outputPath = "E:\\output.txt";
        BufferedReader input = new BufferedReader(new FileReader(inputPath));
        BufferedWriter output = new BufferedWriter(new FileWriter(outputPath));

        String line;
        line = input.readLine();
        int T = Integer.parseInt(line);
        for (int i = 1; i <= T; ++i) {
            line = input.readLine();
            String[] words = line.split(" ");
            int N = Integer.parseInt(words[0]);
            int S = Integer.parseInt(words[1]);
            int p = Integer.parseInt(words[2]);
            int n = 0;
            int res = 0;

            for (int j = 3; j < words.length; ++j) {
                if (p == 0) {
                    res++;
                    continue;
                }

                int t = Integer.parseInt(words[j]);
                if (p == 1) {
                    if (t > 0)
                        res++;
                    continue;
                }
                if (t >= 3 * p - 2)
                    res++;
                else if (t >= 3 * p - 4)
                    n++;
            }

            res += Math.min(n, S);
            output.write("Case #" + i + ": " + res);
            output.newLine();
        }

        input.close();
        output.close();
    }
}

import java.io.*;
import java.util.*;

public class ProjB {
	static Scanner scan = new Scanner (System.in);
	
	static void test (int k ) {
		System.out.print ("Case #" + k + ": ");
		int N = scan.nextInt();
		int S = scan.nextInt();
		int p = scan.nextInt();
		int[] input = new int[N];
		for (int i = 0; i < N; ++i)
			input[i] = scan.nextInt();
		Arrays.sort(input);
		
		int min1 = (p >= 1)? 3*p-2:0;
		int min2 = -1;
		if (p >= 2)
			min2 = 3 * p - 4;
		else if (p == 1)
			min2 = 1;
		else
			min2 = 0;
		int k1 = N - 1;
		while (k1 >= 0 && input[k1] >= min1)
			--k1;
		int ans = N - 1 - k1;
		int k2 = k1;
		while (k2 >=0 && (k1 + 1 - k2) <= S && input[k2] >= min2)
			--k2;
		ans += k1 - k2;
		System.out.println (ans);
		
	}
	
	public static void main (String[] args) {
		int T = scan.nextInt();
		for (int i = 1; i <= T; ++i)
			test (i);
		
	}
}
