package util.graph;

import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.Set;

public class DynDjikstra {
    public static State FindShortest(Node start, Node target) {
        PriorityQueue<Node> openSet = new PriorityQueue<>();
        Set<Node> closedSet = new HashSet<>();
        openSet.add(start);
        while (!openSet.isEmpty()) {
            Node current = openSet.poll();
            for (Edge edge : current.edges) {
                Node end = edge.target;
                if (closedSet.contains(end)) {
                    continue;
                }
                State newState = edge.travel(current.last);
                //if (end.equals(target)) {
                    //return newState;
                //}
                if (openSet.contains(end)) {
                    if (end.last.compareTo(newState)>0) {
                        end.last = newState;
                    }
                } else {
                    openSet.add(end);
                    end.last = newState;
                }
            }
            closedSet.add(current);
            if (closedSet.contains(target)) {
                return target.last;
            }
        }

        return target.last;
    }
}

import java.util.*;
import java.io.*;
public class B {
	public B(Scanner in, PrintWriter out) {
		int T = in.nextInt();
		in.nextLine();
		for (int t=0; t<T; t++) {
			int N = in.nextInt();
			int S = in.nextInt();
			int P = in.nextInt();
			int[] vals = new int[31];
			for (int i=0; i<N; i++)
				vals[in.nextInt()]++;
			int ans = 0;
			for (int d=0; d<=2; d++)
				for (int a=0; a<=10; a++)
					for (int b=Math.max(a-d,0); b<=a; b++)
						for (int c=Math.max(a-d,0); c<=a; c++) {
							if (d < 2 && a >= P) {
								ans+=vals[a+b+c];
								vals[a+b+c]=0;
							} else if (a >= P) {
								int tmp = Math.min(vals[a+b+c], S);
								S -= tmp;
								ans += tmp;
								vals[a+b+c] -= tmp;
							}
						}
			out.printf("Case #%d: %d\n",t+1,ans);
		}
		out.close();
	}
	public static void main(String[] args) throws FileNotFoundException {
		new B(new Scanner(new File("b.in")),new PrintWriter(new File("b.out")));
	}
}
