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.File;
import java.io.FileNotFoundException;
import java.util.Arrays;
import java.util.Scanner;

public class DancingGooglers {
    public static void main(String[] args) throws FileNotFoundException {
        int T;
        //Scanner sc = new Scanner(System.in);
        Scanner sc = new Scanner(new File("input.in"));
        T=sc.nextInt();

        for( int i=0;i<T;i++) {
            int N = sc.nextInt();
            int S = sc.nextInt();
            int p = sc.nextInt();
            int ti[]=new int[N];
            for(int j=0;j<N;j++) {
                ti[j]=sc.nextInt();
            }
            Arrays.sort(ti);
            int count=0;
            for(int j=N-1;j>=0;j--) {
                if(ti[j]/3>=p) {
                    count++;
                }
                else if(ti[j]==0) {
                    break;
                }
                else{
                    float temp = ((float) ti[j])/3;
                    if(p-temp<.9) {
                        count++;
                    }
                    else if(p-temp==1 || p-temp<1.4) {
                        if(S>0) {
                            count++;
                            S--;
                        }
                    }
                }
            }
            System.out.println("Case #"+(i+1)+": "+count);
        }
 
    }
}
