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.StringTokenizer;
public class DancingWithGooglers extends BaseSolution {
	public String solveTestCase() throws Exception {
		String inp = readLine();
		StringTokenizer st = new StringTokenizer(inp);
		int N = Integer.parseInt(st.nextToken());
		int S = Integer.parseInt(st.nextToken());
		int p = Integer.parseInt(st.nextToken());
		int ans=0;
		for(int i=0;i<N;i++){
			int t = Integer.parseInt(st.nextToken());
			int maxNormal=t,maxSurprise=t;
			if(t>0){
				maxNormal = ((t-1)/3) + 1;
			}
			if(t>1){
				maxSurprise = ((t-2)/3) + 2;
				if(maxSurprise>10){
					maxSurprise = 10;
				}
			}
			if(maxNormal>=p){
				ans++;
			} else if(S>0&&maxSurprise>=p){
				S--;
				ans++;
			}
		}
		return ans+"";
	}
		
}
