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

import java.util.Scanner;

/*
 * Google Code Jam 2012
 * Program by Tommy Ludwig
 * Problem: Dancing With the Googlers
 * Date: 2012-04-13
 */


public class dancing {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T, N, S, p;
		T = in.nextInt();
		
		for (int i = 1; i <= T; i++) {
			int y = 0;
			N = in.nextInt();
			S = in.nextInt();
			p = in.nextInt();
			int [] t = new int[N];
			
			for (int j = 0; j < N; j++) 
				t[j] = in.nextInt();
			
			//minimum number with surprise case
			int minNumS = (3 * p) - 4;
			if (minNumS < 2) minNumS = 2;
			//minimum number without surprise case
			int minNum = (3 * p) - 2;
			//if (minNum < 0) minNum = 0;
			
			for (int j = 0; j < N; j++) {
				if (t[j] >= minNum)
					y++;
				else if (t[j] >= minNumS && S > 0) {
					y++;
					S--;
				}
			}
			System.out.printf("Case #%d: %d\n", i, y);
		}
	}

}
