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 codejam.dancing;

import codejam.is.TestAbstract;

import java.util.StringTokenizer;

/**
 * Created with IntelliJ IDEA.
 * User: ofer
 * Date: 4/14/12
 * Time: 4:48 AM
 * To change this template use File | Settings | File Templates.
 */
public class DancingTest extends TestAbstract {


    @Override
    public void run(String s) {
        StringTokenizer tokenizer = new StringTokenizer(s);
        int numOfGooglers = Integer.parseInt(tokenizer.nextToken());
        int numOfSurprises = Integer.parseInt(tokenizer.nextToken());
        int bestResult = Integer.parseInt(tokenizer.nextToken());

        int result = 0;
        for (int i = 0; i < numOfGooglers; i++) {
            int score = Integer.parseInt(tokenizer.nextToken());
            if (score >= bestResult + 2*Math.max(bestResult-1, 0)) {
                result++;
            } else if (score >= (bestResult + 2*Math.max(bestResult-2, 0)) && numOfSurprises > 0) {
                result++;
                numOfSurprises--;
            }
        }

        output.append(result);
    }
}
