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.util.Scanner;

public class Dance
{

    public static void main(String args[]) throws Exception
    {
        int N,S,T,p,ti;
        
        Scanner in = new Scanner( System.in );
        T = in.nextInt();
        int pos = 1;
        while( pos <= T )
        {
        
            N = in.nextInt(); // Number of idiots
            S = in.nextInt(); // Number of times a judge was biased
            p = in.nextInt(); // The best result we are looking for

            int count = 0;
            
            int test_1 = Math.max(p * 3 - 2 , p );
            int test_2 = Math.max( test_1 - 2 , p);
            
            for( int i = 0 ; i < N ;i++)
            {
                ti = in.nextInt();

                if( ti >= test_1 )
                {
                    count++;
                }else if( S > 0 && ti >= test_2 )
                {
                    S--;
                    count++;
                }
            }
            
            System.out.println("Case #" + pos + ": " + count);
            
            pos++;
        }
    }
}