import java.util.*;

public class B {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        B th = new B();
        for (int i = 0; i < T; i++) {
            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();
            int[] t = new int[n];
            for (int j = 0; j < n; j++) {
                t[j] = sc.nextInt();
            }
            int c = th.getAnswer(s,p,t);
            System.out.println("Case #" + (i+1) + ": " + c);
        }
    }
    public int getAnswer(int s, int p, int[] t) {
        int A1 = p + p-1+p-1;
        int A2 = p + p-2+p-2;
        if (A1 < 0)
            A1 = 0;
        if (A2 < 0)
            A2 = 1;
        int remain = s;
        int count = 0;
        int n = t.length;
        for (int i = 0; i < n; i++) {
            if (t[i] >= A1) {
                count++;
            } else if (t[i] < A1 && t[i] >= A2) {
                if (remain > 0) {
                    remain--;
                    count++;
                }
            }
        }
        return count;
    }
}


import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;


public class _2012_QR_ProblemB {
	public static void main(String[] args){
		try {
			BufferedReader in = new BufferedReader(new FileReader("C://B-large.in"));
			BufferedWriter out = new BufferedWriter(new FileWriter("C://B-large.out"));

			int numberOfTests = Integer.parseInt(in.readLine());
			for (int i = 0; i < numberOfTests; i++) {
				
				StringTokenizer st = new StringTokenizer(in.readLine());
				int N = Integer.parseInt(st.nextToken());
				int S = Integer.parseInt(st.nextToken());
				int p = Integer.parseInt(st.nextToken());
				int alto =  (p-1)*3 + 1;
				int baixo = (p != 1) ? (p-1)*3 - 1 : 1;
				int quant = 0;
				int poss = 0;
				for (int j = 0; j < N; j++) {
					int nota = Integer.parseInt(st.nextToken());
					if (nota >= alto){
						quant++;
					}else{
						if (nota >= baixo){
							poss++;
						}
					}
				}
				quant += (poss > S) ?  S :  poss;
				
				out.append("Case #" + (i+1) +": " + quant);
				if (i + 1 < numberOfTests){
					out.newLine();
				}
				

			}
			out.close();
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (NumberFormatException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

	}
}