import java.util.List;


public class Case implements Runnable {

	private int id;
	private String output;

	private int n;
	private int s;
	private int p;
	private List<Integer> g;

	public Case(int id) {
		this.id = id;
	}

	public Case(int id, int n, int s, int p, List<Integer> g) {
		super();
		this.id = id;
		this.n = n;
		this.s = s;
		this.p = p;
		this.g = g;
	}

	public String solve() {
		int res = 0;
		for (int googler : g) {
			int b = googler / 3;
			boolean div = googler % 3 == 0;
			if (b >= p) {
				res++;
				continue;
			}
			if (p == b+1) {
				if (div && s > 0 && b > 0) {
					res++;
					s--;
					continue;
				}
				if (!div) {
					res++;
					continue;
				}
			}
			if (p == b+2) {
				if (3*b+2 == googler && s > 0) {
					res++;
					s--;
				}
			}
		}
		return String.valueOf(res);
	}

	@Override
	public void run() {
		output = solve();
	}

	@Override
	public String toString() {
		return "Case #" + id + ": " + output;
	}

}
import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.Scanner;

/**
 *
 * @author Saul Hidalgo
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        try {
            Scanner sc = new Scanner(new File("test.txt"));
            PrintStream ps = new PrintStream(new File("output.txt"));

            int T = sc.nextInt();
            for ( int t = 1 ; t <= T ; t++ ){
                int n = sc.nextInt(), s = sc.nextInt(), p = sc.nextInt();

                int[] l = new int[n];
                for ( int i = 0 ; i < n ; i++ ){
                    l[i] = sc.nextInt() - p ;
                }

                int a = 0 , b = 0;

                for ( int i = 0 ; i < n ; i++ ){
                    if ( l[i] == -1 && p > 0 ){
                    }else if ( l[i] >= 2*( p - 1 ) ){
                        ++a;
                    }else if ( l[i] >= 2*( p - 2 ) ){
                        ++b;
                    }
                }
                ps.println("Case #" + t + ": " + ( a + b - Math.max(0, b - s ) ));
            }
            
        }
        catch (FileNotFoundException ex) {
            // =(
        }
    }
}
