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.util.Scanner;

/**
 *
 * @author Yasura
 */
public class B {

    public static void main(String[] args) {
        Scanner scanInt= new Scanner(System.in);
        int noOfCases = scanInt.nextInt();
        int N,S,p,t,max;
        for(int i=0;i<noOfCases;i++){
            N=scanInt.nextInt();
            S=scanInt.nextInt();
            p=scanInt.nextInt();
            max=0;
            for(int j=0;j<N;j++){
                t=scanInt.nextInt();
                if(t%3==0){
                    if(t/3>p-1){
                        max++;
                    }
                    else if((t/3==p-1)&&S!=0&&t>2){
                        max++;
                        S--;
                    }
                }
                else if(t%3==1 && (t+2)/3>p-1){
                    max++;
                }
                else if (t%3==2){
                    if((t+1)/3>p-1){
                        max++;
                    }
                    else if ((t+1)/3==p-1&&S!=0){
                        max++;
                        S--;
                    }
                }
            }
            System.out.println("Case #"+(i+1)+": "+max);
        }
    }
}
