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


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

package javaapplication2;

import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

/**
 *
 * @author Mash
 */
public class B {
     public static void main(String[] args) throws IOException{
    Scanner in = new Scanner(new FileReader("C:\\ima\\ans.txt"));
    PrintWriter out=new PrintWriter(new FileWriter("C:\\ima\\input.txt"));
    int T,S,p,N,G[];
    T=in.nextInt();
    for(int i=1;i<=T;i++){
        N=in.nextInt();
        G=new int[N];
        S=in.nextInt();
        p=in.nextInt();
        for(int j=0;j<N;j++)G[j]=in.nextInt();
        Arrays.sort(G);
        if(p>1){
        int q=p*3-2;
        int s=p*3-4;
        int cnt=0;
        int pt=N-1;
        for(int j=N-1;j>=0;j--){
            if(G[j]>=q){cnt++;pt--;}
        }
        while(pt>=0&&G[pt]>=s&&S>0){
            cnt++;pt--;S--;
        }
        System.out.println("Case #"+i+": " +cnt);
    }else if(p==1){
        int m=0;
       for(m=0;m<N;m++){
          if(G[m]>0)break;
       }
       System.out.println("Case #"+i+": " +(N-m));
    }else if(p==0)System.out.println("Case #"+i+": "+N);
         }
    }

}
