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);
        }
    }
}

package DancingWithTheGooglers;

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintWriter;
import java.util.Collections;
import java.util.Scanner;
import java.util.ArrayList;

public class DancingWithTheGooglers {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner in = new Scanner(new FileInputStream("input.txt"));
		PrintWriter out = new PrintWriter(new FileOutputStream("output.txt"));
		
		int lines = in.nextInt();
		in.nextLine();
		int counter = 0;
		
		for (;counter<lines;counter++) {
			out.write("Case #" + (counter+1) + ": ");
			
			int n = in.nextInt();
			int s = in.nextInt();
			int p = in.nextInt();
			int finalCount = 0;
			ArrayList<Integer> scores = new ArrayList<Integer>();
			for (int i = 0; i<n; i++) {
				scores.add(in.nextInt());
			}
			Collections.sort(scores);
			for (int i: scores) {
				if (i<p)
					continue;
				else if ((((i-2)/3)+2)<p)
					continue;
				else if ((((i-1)/3)+1)>=p)
					finalCount++;
				else if (s>0) {
					s--;
					finalCount++;
				}
			}
			out.write(finalCount + "\n");
		}
		
		in.close();
		out.close();
	}
}
