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.*;
import java.util.*;
import java.math.*;

public class DancingWithTheGooglers {
    
    public static void main (String args[]) throws Exception {
	Scanner scan = new Scanner(System.in);
	int T = scan.nextInt();
	for (int i = 1; i <= T; i++){
	    int N = scan.nextInt();
	    int S = scan.nextInt();
	    int p = scan.nextInt();
	    int result = 0;
	    for (int x = 0; x < N; x++){
		int tot_score = scan.nextInt();
		int ave = tot_score / 3;
		int rem = tot_score % 3;
		if (ave >= p){
		    result++;
		} else if (((rem == 1)||(rem ==2)) && ((ave + 1) == p)){
		    result++;
		} else if ( S > 0) {
		    if ((rem == 2) && ((ave + rem) == p)){
			result++;
			S--;
		    } else if ((rem == 0) && ((ave + 1) == p)){
			if (ave == 0){
			    ;
			} else {
			    result++;
			    S--;
			}
		    }
		}
	    }
	    System.out.println("Case #" + i + ": " + result);
	}
    }
}