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

class QB{

	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int kase = sc.nextInt();
		for(int k = 1; k<=kase; k++){
			int N = sc.nextInt();
			int S = sc.nextInt();
			int p = sc.nextInt();
			int[] tots = new int[N];
			for(int i = 0; i<N; i++)tots[i] = sc.nextInt();
			Arrays.sort(tots);
			int i = tots.length;//index of last reasonable score.
			while(i>0 && tots[i-1]>=(3*p-2)) i--;
			int j = 0;
			if(p!=1){
			 while(i>0 && tots[i-1]>= 3*p-4 && j<S){i--;j++;}
			}
			System.out.println("Case #"+k+": "+(N-i));
		}
	}
}
