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 DancingWithTheGooglers {
	public static int Solve(String q) {
		StringTokenizer st = new StringTokenizer(q, " ");
		int n = Integer.parseInt(st.nextToken());
		int s = Integer.parseInt(st.nextToken());
		int p = Integer.parseInt(st.nextToken());
		int t;
		int d;
		int r;
		int ans = 0;
		
		while(st.hasMoreTokens()) {
			t = Integer.parseInt(st.nextToken());
			d = t / 3;
			r = t % 3;
			
			if(p - d <= 0) 
				ans++;
			else if(p - d == 1) {
				if(r != 0)
					ans++;
				else if(s > 0 && r == 0 && t != 0) {
					s--;
					ans++;
				}
			}
			else if(p - d == 2 && s > 0 && r == 2) {
				ans++;
				s--;
			}
		}
		
		return ans;
	}
}
