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.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.lang.reflect.Array;
import java.util.Arrays;
import java.util.Scanner;


public class B {
	private static final String INPUTFILE = "./B-large.in";
	private static final String OUTPUTFILE = "./B-large.out";
	private static FileReader in;
	private static FileWriter out;
	private static BufferedReader buffIn;
	private static BufferedWriter buffOut;
	private static Scanner s;

	public static String executeSingle(){
		int res = 0;
		int N = s.nextInt();
		int S = s.nextInt();
		int p = s.nextInt();
		int[] t= new int[N];
		for(int i=0;i<N;i++){
			t[i] = s.nextInt();
		}
		Arrays.sort(t);
		int minimumOKScore = p+Math.max(p-1, 0)*2;
		int minimumPossibleScore = p+Math.max(p-2, 0)*2;
		//tant que le score est plus grand que le plus petit plausible possible (p+p-1+p-1)
		
		for(int i=N-1;i>=0;i--){
			if(t[i]>= minimumOKScore){
				res++;
			}
			else if(t[i]>= minimumPossibleScore && S > 0){
				S--;
				res++;
			}
		}
		
		
		return ""+res;
	}


	public static void execute() throws IOException{
		int n = s.nextInt();
		s.nextLine();
		for(int i=1;i<=n;i++){
			buffOut.append("Case #"+i+": "+executeSingle());
			buffOut.newLine();
			//System.out.println("Case #"+i+": "+executeSingle());
		
		}
	}


	public static void main(String[] args) throws IOException {
		in = new FileReader(INPUTFILE);
		out = new FileWriter(OUTPUTFILE);
		buffIn = new BufferedReader(in);
		buffOut = new BufferedWriter(out);
		s = new Scanner(buffIn);
		execute();
		buffOut.flush();
		buffOut.close();
		buffIn.close();
		out.close();
		in.close();
	}

}