package com.gcj.parser;

public class MaxPoints {

	public static int normal(int value){
		int toReturn = 0;
		switch (value) {
		case 0 : toReturn = 0 ; break;
		case 1 : toReturn = 1 ; break;
		case 2 : toReturn = 1 ; break;
		case 3 : toReturn = 1 ; break;
		case 4 : toReturn = 2 ; break;
		case 5 : toReturn = 2 ; break;
		case 6 : toReturn = 2 ; break;
		case 7 : toReturn = 3 ; break;
		case 8 : toReturn = 3 ; break;
		case 9 : toReturn = 3 ; break;
		case 10 : toReturn = 4 ; break;
		case 11 : toReturn = 4 ; break;
		case 12 : toReturn = 4 ; break;
		case 13 : toReturn = 5 ; break;
		case 14 : toReturn = 5 ; break;
		case 15 : toReturn = 5 ; break;
		case 16 : toReturn = 6 ; break;
		case 17 : toReturn = 6 ; break;
		case 18 : toReturn = 6 ; break;
		case 19 : toReturn = 7 ; break;
		case 20 : toReturn = 7 ; break;
		case 21 : toReturn = 7 ; break;
		case 22 : toReturn = 8 ; break;
		case 23 : toReturn = 8 ; break;
		case 24 : toReturn = 8 ; break;
		case 25 : toReturn = 9 ; break;
		case 26 : toReturn = 9 ; break;
		case 27 : toReturn = 9 ; break;
		case 28 : toReturn = 10 ; break;
		case 29 : toReturn = 10 ; break;
		case 30 : toReturn = 10 ; break;

		}

		return toReturn;
	}

	public static int surprising(int value){
		int toReturn = 0;
		switch (value) {
		case 0 : toReturn = 0 ; break;
		case 1 : toReturn = 1 ; break;
		case 2 : toReturn = 2 ; break;
		case 3 : toReturn = 2 ; break;
		case 4 : toReturn = 2 ; break;
		case 5 : toReturn = 3 ; break;
		case 6 : toReturn = 3 ; break;
		case 7 : toReturn = 3 ; break;
		case 8 : toReturn = 4 ; break;
		case 9 : toReturn = 4 ; break;
		case 10 : toReturn = 4 ; break;
		case 11 : toReturn = 5 ; break;
		case 12 : toReturn = 5 ; break;
		case 13 : toReturn = 5 ; break;
		case 14 : toReturn = 6 ; break;
		case 15 : toReturn = 6 ; break;
		case 16 : toReturn = 6 ; break;
		case 17 : toReturn = 7 ; break;
		case 18 : toReturn = 7 ; break;
		case 19 : toReturn = 7 ; break;
		case 20 : toReturn = 8 ; break;
		case 21 : toReturn = 8 ; break;
		case 22 : toReturn = 8 ; break;
		case 23 : toReturn = 9 ; break;
		case 24 : toReturn = 9 ; break;
		case 25 : toReturn = 9 ; break;
		case 26 : toReturn = 10 ; break;
		case 27 : toReturn = 10 ; break;
		case 28 : toReturn = 10 ; break;
		case 29 : toReturn = 10 ; break;
		case 30 : toReturn = 10 ; break;

		}
		return toReturn;
	}

}

import java.util.Arrays;
import java.util.Scanner;


public class dancingWithTheGooglers {
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int nCases = in.nextInt();
		for (int c = 0; c < nCases; c++) {
			int n = in.nextInt();
			int s = in.nextInt();
			int min = in.nextInt();
			//System.out.printf("%d is the best result we're looking for\n", min);
			int[] t = new int[n];
			for (int i = 0; i < n; i++) {
				t[i] = in.nextInt();
			}
			Arrays.sort(t);
			int unsurprisingMinTotal = min + 2*(min-1 < 0 ? 0 : min-1);
			int surprisingMinTotal = min + 2*(min-2 < 0 ? 0 : min-2);
			int count = 0;
			int surprisesLeft = s;
			while (surprisesLeft >= 0) {
				if (t[t.length-1-count] >= unsurprisingMinTotal) {
					//System.out.printf("%d is unsurprising\n", t[t.length-1-count]);
					count++;
				} else if(t[t.length-1-count] >= surprisingMinTotal && surprisesLeft > 0) {
					//System.out.printf("%d is surprising\n", t[t.length-1-count]);
					surprisesLeft--;
					count++;
				} else {
					//System.out.printf("%d is rejected\n", t[t.length-1-count]);
					surprisesLeft = -1;
				}
				
				if (count >= t.length) {
					break;
				}
			}
			System.out.printf("Case #%d: %d\n", c+1, count);
		}
	}
}
