import java.io.*;
import java.math.*;
import java.util.*;
import java.text.*;

public class b {
    public static void main(String[] args) {
        Scanner sc = new Scanner(new BufferedInputStream(System.in));

        int T = sc.nextInt();

        for (int casenumber = 1; casenumber <= T; ++casenumber) {

            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();

            int[] ts = new int[n];
            for (int i = 0; i < n; ++i)
                ts[i] = sc.nextInt();

            int thresh1 = (p == 1 ? 1 : (3 * p - 4));
            int thresh2 = (3 * p - 2);

            int count1 = 0, count2 = 0;

            for (int i = 0; i < n; ++i) {
                if (ts[i] >= thresh2) {
                    ++count2;
                    continue;
                }
                if (ts[i] >= thresh1) {
                    ++count1;
                }
            }

            if (count1 > s) {
                count1 = s;
            }

            System.out.format("Case #%d: %d%n", casenumber, count1 + count2);
        }
    }
}

import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.Collections;
import java.util.Scanner;
import java.util.Vector;


public class pbB {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner sc = new Scanner(new FileReader("test.in"));
		PrintWriter out= new PrintWriter("output.out");
		
		int k=sc.nextInt(), n,s,p,rep,sup,inf; Vector<Integer> scores;		
		for(int i=1;i<=k;i++){
			scores= new Vector<Integer>(); 
			n= sc.nextInt();s=sc.nextInt();p=sc.nextInt();
             for(int h= 0;h<n;h++) scores.add(sc.nextInt());
             Collections.sort(scores);
             rep=0; sup= p<1? p: 2*(p-1)+p; inf = p<2 ? p: 2*(p-2)+p;
             for(int h=scores.size()-1;h>=0;h--){
            	 if(scores.elementAt(h)>=sup) rep++;
            	 else if (scores.elementAt(h)>=inf && s>0){
            	    rep++;s--;
            	 }            	 
             }
		   out.print("Case #"+i+": "+rep);
		   if (i!=k) out.println();
		}
	out.close();
}
}
