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;
	}

}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package googlecodejam;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;

/**
 *
 * @author massimo
 */
public class ProblemB {

    //It can be proven that b=min{10,2+floor((totalPoints-2)/3)),totalPoints} if the best possibile result.
    //The triple must be surprising iff totalPoints<=3*(b-1).
    public static void main(String[] args) throws FileNotFoundException, IOException {
        BufferedReader in = new BufferedReader(new FileReader("in.in"));
        PrintWriter out = new PrintWriter("out.out");
        int t = Integer.parseInt(in.readLine());
        for (int i = 1; i <= t; i++) {
            StringTokenizer st = new StringTokenizer(in.readLine(), " ");
            int n = Integer.parseInt(st.nextToken());
            int s = Integer.parseInt(st.nextToken());
            int p = Integer.parseInt(st.nextToken());
            int res = 0, surprising = 0;
            for (int j = 0; j < n; j++) {
                int totalPoints = Integer.parseInt(st.nextToken());
                int b = Math.min(Math.min(totalPoints, 10), 2 + (totalPoints - 2) / 3);
                if (b > p) {
                    res++;
                } else if (b == p) {
                    if (totalPoints>3*(b-1)) {
                        res++;
                    } else if (surprising<s) {
                        res++;
                        surprising++;
                    }
                }
            }
            out.println("Case #"+i+": "+res);
        }
        out.close();
    }
}
