/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package codejam.common;

import java.util.ArrayList;
import java.util.List;

/**
 *
 * @author Lance Chen
 */
public class CodeHelper {

    private static String FILE_ROOT = "D:/workspace/googlecodejam/meta";

    public static List<List<String>> loadInputsExcludes(String fileName) {
        List<List<String>> result = new ArrayList<List<String>>();
        List<String> lines = FileUtil.readLines(FILE_ROOT + fileName);
        int index = 0;
        for (String line : lines) {
            if (index == 0) {
                index++;
                continue;
            }
            if (index % 2 == 1) {
                index++;
                continue;
            }
            List<String> dataList = new ArrayList<String>();
            String[] dataArray = line.split("\\s+");
            for (String data : dataArray) {
                if (data.trim().length() > 0) {
                    dataList.add(data);
                }
            }
            result.add(dataList);
            index++;
        }
        return result;
    }

    public static List<List<String>> loadInputs(String fileName) {
        List<List<String>> result = new ArrayList<List<String>>();
        List<String> lines = FileUtil.readLines(FILE_ROOT + fileName);
        for (String line : lines) {
            List<String> dataList = new ArrayList<String>();
            String[] dataArray = line.split("\\s+");
            for (String data : dataArray) {
                if (data.trim().length() > 0) {
                    dataList.add(data);
                }
            }
            result.add(dataList);
        }
        return result;
    }

    public static List<String> loadInputLines(String fileName) {
        return FileUtil.readLines(FILE_ROOT + fileName);
    }

    public static void writeOutputs(String fileName, List<String> lines) {
        FileUtil.writeLines(FILE_ROOT + fileName, lines);
    }
}

package qualifying;

import java.util.*;

public class DancingWithGooglers {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		
		final int T = in.nextInt();
		for (int testCase = 1; testCase <= T; ++testCase) {

			// initialize parameters
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			
			int[] t = new int[N];
			for (int i = 0; i < N; ++i)
				t[i] = in.nextInt();
			Arrays.sort(t);
			
			// make as many people as possible >= p
			int overCount = 0;
			for (int i = N - 1; i >=0; --i) {
				int disagree = minDisagreement(t[i], p);
				if (disagree > 2) {
					break;
				} else if (disagree == 2 && S == 0) {
					break;
				} else if (disagree == 2) {
					--S;
				}
				++overCount;
			}
			assert (S == 0);
			System.out.printf("Case #%d: %d\n", testCase, overCount);
			
		}
	}
	
	private static int minDisagreement(int total, int minHighScore) {
		if (total >= 3 * minHighScore)
			return 0;
		else if (total < minHighScore)
			return Integer.MAX_VALUE; //i.e. impossible
		else
			return minHighScore - (total - minHighScore)/2;
	}
	
}
