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.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;

public class ProblemB {

    public static void main(String[] args) throws IOException {
        Scanner s = new Scanner(System.in);
        PrintWriter pw = new PrintWriter(new FileWriter("B.out"));
        int cas = s.nextInt();
        
        for( int i = 0; i < cas; i++){
            
            int N = s.nextInt();
            int S = s.nextInt();
            int p = s.nextInt();
            
            int noS = 0;
            int Pmaxs = 0;
            for( int n = 0; n < N; n++){
                int t = s.nextInt();
                int ter = t/3;
                
                    switch(t%3){
                        case 0:{
                            if(ter >= p){
                                Pmaxs++;
                            }else if(ter+1 >= p && ter+1 <= 10 && ter+1 <= t && ter-1 >= 0 ){
                                noS++;
                                Pmaxs++;
                            }
                            break;
                        }
                        case 1:{
                            if(ter >= p){
                                Pmaxs++;
                            }else if(ter+1 >= p && ter+1 <= 10){
                                Pmaxs++;
                            }
                            break;
                        }
                        case 2:{
                            if(ter >= p){
                                Pmaxs++;
                            }else if(ter+1 >= p && ter+1 <= 10){
                                Pmaxs++;
                            }else if(ter+2 >= p && ter+2 <= 10){
                                noS++;
                                Pmaxs++;
                            }
                            break;
                        }
                    }
                
            }
            if(noS > S){ Pmaxs -= (noS - S); }
            pw.println("Case #"+(i+1)+": "+Pmaxs);
        }
        pw.close();
        s.close();
    }
}
