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;
    }
}


package dancingwithgooglers;

import java.util.Scanner;

public class Main {

    static enum Mark {
        IMPOSSIBLE, SURPRISING, REGULAR;
    }

    static class Googler {
        
        private int total = 0;

        public Googler(int total)
        {
            this.total = total;
        }

        public Mark canGetMark(int mark)
        {
            if(mark > 10 || mark < 0) return Mark.IMPOSSIBLE;
            
            if(canGetMark(mark+1) == Mark.REGULAR) return Mark.REGULAR;

            if(mark + mark + mark == total) return Mark.REGULAR;
            if(mark > 0) if(mark + mark + mark - 1 == total) return Mark.REGULAR;
            if(mark > 0) if(mark + mark - 1 + mark - 1 == total) return Mark.REGULAR;
            if(mark < 10) if(mark + mark + mark + 1 == total) return Mark.REGULAR;
            if(mark < 10) if(mark + mark + 1 + mark + 1 == total) return Mark.REGULAR;

            if(canGetMark(mark+1) == Mark.SURPRISING) return Mark.SURPRISING;

            if(mark < 9) if(mark + mark + 1 + mark + 2 == total) return Mark.SURPRISING;
            if(mark < 9) if(mark + mark + 2 + mark + 2 == total) return Mark.SURPRISING;
            if(mark > 1) if(mark + mark - 1 + mark - 2 == total) return Mark.SURPRISING;
            if(mark > 1) if(mark + mark - 2 + mark - 2 == total) return Mark.SURPRISING;

            return Mark.IMPOSSIBLE;
        }

    }
   
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();

        for(int testCase = 1; testCase <= T; testCase++)
        {
            int N = sc.nextInt();
            int S = sc.nextInt();
            int p = sc.nextInt();
            int result = 0;
            for(int i = 0; i < N; i++)
            {
                Googler googler = new Googler(sc.nextInt());
                Mark mark = googler.canGetMark(p);
                if(mark == Mark.REGULAR)
                {
                    result++;
                }
                else if(mark == Mark.SURPRISING && S > 0)
                {
                    result++;
                    S--;
                }
            }
            System.out.println("Case #"+testCase+": "+result);
        }
    }

}
