/**
 * Created by IntelliJ IDEA.
 * User: Administrator
 * Date: 3/3/12
 * Time: 11:00 AM
 * To change this template use File | Settings | File Templates.
 */

import SRMLib.MathLibrary;
import SRMLib.TestSRMLib;
import com.sun.org.apache.bcel.internal.generic.F2D;

import java.io.*;
import java.util.*;
import java.util.zip.Inflater;

public class SRM {
    public static void main(String[] args) throws IOException {
        //TestSRMLib.run();
        codeJam1.main();

        return;
    }
}
class codeJam1 {
    public static void main() throws IOException {
        String inputPath = "E:\\input.txt";
        String outputPath = "E:\\output.txt";
        BufferedReader input = new BufferedReader(new FileReader(inputPath));
        BufferedWriter output = new BufferedWriter(new FileWriter(outputPath));

        String line;
        line = input.readLine();
        int T = Integer.parseInt(line);
        for (int i = 1; i <= T; ++i) {
            line = input.readLine();
            String[] words = line.split(" ");
            int N = Integer.parseInt(words[0]);
            int S = Integer.parseInt(words[1]);
            int p = Integer.parseInt(words[2]);
            int n = 0;
            int res = 0;

            for (int j = 3; j < words.length; ++j) {
                if (p == 0) {
                    res++;
                    continue;
                }

                int t = Integer.parseInt(words[j]);
                if (p == 1) {
                    if (t > 0)
                        res++;
                    continue;
                }
                if (t >= 3 * p - 2)
                    res++;
                else if (t >= 3 * p - 4)
                    n++;
            }

            res += Math.min(n, S);
            output.write("Case #" + i + ": " + res);
            output.newLine();
        }

        input.close();
        output.close();
    }
}

import java.util.*;
import java.io.*;

public class B {	
	
    public static void main(String[] args) throws IOException {

        Scanner in = new Scanner(new File("B-small-attempt4.in"));
		FileWriter fw = new FileWriter("B-small.out");	
		int T = in.nextInt();
		
		for (int cases = 1; cases <= T; cases++){
			
			// read parameters for this case
			int N = in.nextInt();
			int S = in.nextInt();
			int P = in.nextInt();
			
			// read the data to an array point
			int[] point = new int[N];
			fw.write("Case #" + cases + ": ");
			for (int i = 0; i < N; i++){
				point[i] = in.nextInt();							
			}
			
			// quicksort the array point		
			QuickSort result = new QuickSort(point);
			result.sort();
			
			/* this is used to test
			for (int i = 0; i < N; i++){
				fw.write(" " + point[i]);							
			}
			*/			
			
			// this part is to get the number for this case
			
			int number = N - 1;			
			for (int i = N - 1; i >= 0 && point[i] >= 3 * P - 2; i--){
				number = i - 1;				
			}
			// fw.write("\nP is " + P +" Number is " + number + "      ");
			
			int total = N - 1 - number;
			
			// this part is to inclusice the S
			for (int j = 0; j < S && j <= number && point[number - j] >= 3 * P - 4  && point[number - j] >= 2; j++) {
				total = N - 1 - number + j +1;
			}
			fw.write(total + "\n");
			
		}
		fw.flush();
		fw.close();		
	}
}

// this is the quicksork
class QuickSort {
	private int[] a;
	
	public QuickSort(int[] anArray){
       a = anArray;
    }
   
    public void sort(){
       sort(0, a.length - 1);
    }
 
    public void sort(int low, int high){
		if (low >= high) return;
		int p = partition(low, high);
		sort(low, p);
		sort(p + 1, high);
    }
 
    private int partition(int low, int high){
       // First element
       int pivot = a[low]; 
       int i = low - 1;
       int j = high + 1;
		while (i < j) {
			i++; while (a[i] < pivot) i++;
			j--; while (a[j] > pivot) j--;
			if (i < j) swap(i, j);
		}
		return j;
	}
 
    /**
       Swaps two entries of the array.
       @param i the first position to swap
       @param j the second position to swap
    */
    private void swap(int i, int j){
		int temp = a[i];
		a[i] = a[j];
		a[j] = temp;
	}
}
	