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.FileNotFoundException;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.Scanner;


public class googler {

	
	public static void main(String args[]) throws FileNotFoundException
	{
		
		Scanner in=new Scanner(new FileReader("input.in"));
		PrintWriter pw=new PrintWriter("ans.txt");
		
		
		int cases=in.nextInt();
		in.nextLine();
		for(int counter=1;counter<=cases;counter++)
		{
			int n=in.nextInt();
			int s=in.nextInt();
			int p=in.nextInt();
			
			System.out.println(n+" "+s+" "+p);
			int req;
			if(p==0)
			{
				pw.println("Case #"+(counter)+": "+n);
				in.nextLine();
				continue;
			}
			else
				req=p*3-2;
			
			int min=req-2>0?req-2:1;
			
			int answer=0;
			
			for(int j=0;j<n;j++)
			{
				int score=in.nextInt();
				
				if(score>=req)
				{
					answer++;
					continue;
				}
				else if(score>=min&&s>0)
				{
					answer++;
					s--;
				}					
			}
			
			pw.println("Case #"+(counter)+": "+answer);
		}
		pw.close();
	}
}
