import java.io.*;
import java.math.*;
import java.util.*;
import java.text.*;

public class b {
    public static void main(String[] args) {
        Scanner sc = new Scanner(new BufferedInputStream(System.in));

        int T = sc.nextInt();

        for (int casenumber = 1; casenumber <= T; ++casenumber) {

            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();

            int[] ts = new int[n];
            for (int i = 0; i < n; ++i)
                ts[i] = sc.nextInt();

            int thresh1 = (p == 1 ? 1 : (3 * p - 4));
            int thresh2 = (3 * p - 2);

            int count1 = 0, count2 = 0;

            for (int i = 0; i < n; ++i) {
                if (ts[i] >= thresh2) {
                    ++count2;
                    continue;
                }
                if (ts[i] >= thresh1) {
                    ++count1;
                }
            }

            if (count1 > s) {
                count1 = s;
            }

            System.out.format("Case #%d: %d%n", casenumber, count1 + count2);
        }
    }
}

import java.io.*;
import java.util.*;

public class dancing {
	public static void main(String[] args)throws Exception{
		Scanner f = new Scanner(new File(args[0]));
		int count=0;//# tuples >= limit
		int res=0;	//mult result
		int rem=0;	//remainder
		int N=0;	//# tuples
		int S=0;	//# surprising tuples (t%r==2)
		int s=0;	//current count of surprising tuples
		int l=0;	//the limit
		int minT=0,maxT=10;	//minmum & maximum T values;
		ArrayList<Integer> al=new ArrayList<Integer>();	//list of tuples
		int C=0;	//# cases
		
		C = f.nextInt(); //get # of test cases
		for (int c=1;c<=C;c++){ //for each test case
			N=f.nextInt();S=f.nextInt();l=f.nextInt();//get params
			count=0;	//reset # good tuples count
			s=0;		//reset surprising tuple count
			al.clear();	//reset t list
			for(int i=1;i<=N;i++)al.add(f.nextInt());//build t list
			Collections.sort(al);	//sort lowest to highest
			Collections.reverse(al);//sort highest to lowest
			/*for (Integer x: al)System.out.print(x + " ");*/
			for (Integer t:al) {
				res=t/3; rem=t%3;
				if (res >= l)
					count++;
				else if (res == l-1)
					if (rem != 0)
						count++;
					else {// rem==0
						if (s<S && res>minT) {
							count++;
							s++;
						}
					}
				else if (res == l-2)
					if (rem == 2) {
						if (s < S) {
							count++;
							s++;
						}
					}
			}
			
			System.out.println("Case #"+c+": "+count);//display result
		}
	}
}