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;


public class Main {
	public static void main(String [] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for(int x=0; x<T; x++) {
			int N = in.nextInt(); //googlers
			int S = in.nextInt(); //surprising
			int p = in.nextInt(); //score to beat
			
			int direct = 0;
			int poss = 0;
			
			for(int i=0; i<N; i++) {
				int total = in.nextInt();
				int m = total/3;
				int mod = total %3;
				if(mod >0)
					m++;
				if(m>=p) {
					direct++;
					continue;
				}
				else if(m<p-1)
					continue;
				//Time to use possibilities
				switch(mod) {
				case 0:
					if(m<10 && m>0)
						poss++;
					break;
				case 2:
					if(m<10)
						poss++;
					break;
				}
			}
			int result = (S>poss)? poss : S;
			result += direct;
			System.out.print("Case #" + String.valueOf(x+1) + ": ");
			System.out.println(result);
		}
	}
}