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 hk.polyu.cslhu.codejam.solution;

import java.util.List;

import org.apache.log4j.Logger;

public abstract class Solution implements Cloneable {
	public static Logger logger = Logger.getLogger(Solution.class);
	
	protected String result;
	
	/**
	 * Set the problem to be solved
	 * 
	 * @param problemDesc List<String> The description of problem
	 */
	public abstract void setProblem(List<String> problemDesc);
	
	/**
	 * Solve the problem
	 */
	public abstract void solve();
	
	/**
	 * Return the result of problem
	 * 
	 * @return String Result
	 */
	public String getResult() {
		return this.result;
	}
	
	public Solution clone() throws CloneNotSupportedException {
		return (Solution) super.clone();
	}
}
