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

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}

import java.util.*;
import java.io.*;

public class Dancing {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException {
		new Dancing().run();
	}

	Integer[] best = new Integer[31];
	int best(int x) {
		if (best[x] != null)
			return best[x];
		for (int l = 0; l <= Math.min(x, 8); l++) {
			for (int m = l; m <= l + 2 && m + l <= x; m++) {
				int h = l + 2;
				if (l + m + h == x) {
					best[x] = h;
				}
			}
		}
		if (best[x] == null)
			best[x] = -1;
		return best[x];
	}
	
	void run() throws IOException {
		br = new BufferedReader(new InputStreamReader(System.in));
		out = new PrintWriter(System.out);
		
		for (int i = 0; i <= 30; i++)
			System.err.println("" + i + "," + best(i) + "," + ((i + 2) / 3));
		
		int T = nextInt();
		for (int tt = 0; tt < T; tt++) {
			int n = nextInt(), s = nextInt(), p = nextInt();
			
			int ans = 0;
			ArrayList<Integer> list = new ArrayList<Integer>();
			for (int i = 0; i < n; i++) {
				int x = nextInt();
				if (x < 2) {
					if (x >= p)
						ans++;
				} else if (x > 28) {
					ans++;
				} else {
					list.add(x);
				}
			}
			
			Integer[] arr = new Integer[0];
			arr = list.toArray(arr);
			
			Arrays.sort(arr);
			
			int rem = s;
			for (int i = 0; i < arr.length; i++) {
				int x = arr[i];
				if (best(x) >= p && (x + 2) / 3 < p && rem > 0) {
					ans++;
					rem--;
				} else if ((x + 2) / 3 >= p) {
					ans++;
				}
			}
			
			System.out.println("Case #" + (tt + 1) + ": " + ans);
		}
		
		out.close();
	}
	
	BufferedReader br;
	StringTokenizer st;
	PrintWriter out;
	
	String next() throws IOException {
		while (st == null || !st.hasMoreTokens()) {
			st = new StringTokenizer(br.readLine());
		}
		return st.nextToken();
 	}
	
	int nextInt() throws IOException {
		return Integer.parseInt(next());
	}
	
}
