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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author joshuahm
 */
public class codejamB {
    public static void main(String[] args) throws FileNotFoundException, IOException {
        FileReader inFile = new FileReader("B-large.in");
        Scanner in = new Scanner(inFile);
        FileWriter outFile = new FileWriter("B-large.out");
        PrintWriter out = new PrintWriter(outFile);
        int T= in.nextInt();
        for(int k=0;k<T;k++)
        {
            int N= in.nextInt();
            int S= in.nextInt();
            int p= in.nextInt();
            int[] total= new int[N];
            for(int i=0;i<N;i++)
                total[i]= in.nextInt();
            int possible=0;
            int surprising=0;
            for(int i=0;i<N;i++)
            {
                if(total[i]>3*p-3)
                    possible++;
                else if(total[i]>Math.max(3*p-5,0))
                    surprising++;
            }
            out.println("Case #"+ (k+1) +": "  + (possible + Math.min(surprising, S)));
        }
        in.close();
        out.close();
    }
}
