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

import java.io.File;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Scanner;
import java.util.Set;

/**
 *
 * @author daniele
 */
public class GCJ_B {
    
    
    public static void main(String[] args) throws Exception{
        
        
        Scanner in = new Scanner(new File(args[0]));
        FileWriter out = new FileWriter("/home/daniele/Scrivania/Output");
        
        int n,p,s;
        int countp=0,counts=0;
        int prove=in.nextInt();
        ArrayList<Integer> tp;
        
        
        
        out.write("");
        out.flush();
        
        for(int i=1;i<=prove;i++){
            out.append("Case #" +i+": ");out.flush();
            n=in.nextInt();
            s=in.nextInt();
            p=in.nextInt();
            tp= new ArrayList<Integer>();
            for(int j=0;j<n;j++)
                tp.add(in.nextInt());
            
            for(int j=0;j<tp.size();j++){
                int f=tp.get(j)-p;
                if( f>=0 && f/2>=p-2){
                    countp++;
                    if( f/2==p-2 && s==0 )
                      countp--;
                    else if(f/2==p-2 && s>0)
                        s--; 
                }
                
            }
            System.out.println("countp="+countp+" counts="+counts+" s="+s);

            out.append(countp+"\n");out.flush();
            countp=0; counts=0;
            System.out.println("**************");


        }
     
        
        
    }
    
    
    
}
