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.*;

public class Dance
{
    public static void main(String args[])
    {
        Scanner input = new Scanner(System.in);
        int numCase;
        numCase = input.nextInt();
        for(int n=0; n<numCase; n++)
        {
            int numGoog, surprising, min, maxAboveMin;
            maxAboveMin = 0;

            numGoog = input.nextInt();
            surprising = input.nextInt();
            min = input.nextInt();

            int[] scores = new int[numGoog];
            int[] bestIfS = new int[numGoog];
            int[] bestIfNS = new int[numGoog];
            for(int i=0; i<numGoog; i++)
            {
                scores[i] = input.nextInt();
                if(scores[i]>0)
                {
                    bestIfS[i] = (int)((double)scores[i]/3+1.5);
                    bestIfNS[i] = (int)((double)scores[i]/3+0.7); // Rounding
                } else {
                    bestIfS[i] = 0;
                    bestIfNS[i] = 0;
                }

                /*
                 *System.out.printf("S:%d !:%d N:%d\n",scores[i]
                 *                                     bestIfS[i],
                 *                                     bestIfNS[i]);
                 */
            }

            for(int i=0; i<numGoog; i++)
            {
                if(bestIfNS[i]>=min) { maxAboveMin++; }
                else if (surprising>0 && bestIfS[i]>=min)
                {
                    maxAboveMin++;
                    surprising--;
                }
            }

            System.out.printf("Case #%d: %d\n",n+1,maxAboveMin);

        }
    }
}
