/*
 * 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.*;

public class B {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);

		int T = in.nextInt();
		int N, S, p;

		for (int x = 1; x <= T; x++) {
			N = in.nextInt();
			S = in.nextInt();
			p = in.nextInt();

			int[] t = new int[N];
			int y = 0;

			for (int i = 0; i < N; i++) {
				t[i] = in.nextInt();

				int k = t[i] / 3;
				int j1 = -1, j2 = -1, j3 = -1;
 
				// not surprising triplets
				if ((k + 1) + (k + 1) + k == t[i]) {
					j1 = k + 1;
					j2 = k + 1;
					j3 = k;
				}

				else if ((k + 1) + k + k == t[i]) {
					j1 = k + 1;
					j2 = k;
					j3 = k;
				}

				else if (3 * k == t[i]) {
					j1 = k;
					j2 = k;
					j3 = k;
				}

				if (j1 >= p || j2 >= p || j3 >= p) {
					y++;
					continue;
				}

				if(S==0) continue;
				
				// surprising triplets
				if (k != 9 && (k + 2) + k + k == t[i]) {
					j1 = k + 2;
					j2 = k;
					j3 = k;
				} else if (k != 0 && ((k + 1) + (k + 1) + (k - 1) == t[i])) {
					j1 = k + 1;
					j2 = k + 1;
					j3 = k - 1;
				} else if (k != 0 && ((k + 1) + k + (k - 1) == t[i])) {
					j1 = k + 1;
					j2 = k;
					j3 = k - 1;
				}
				
				if (j1 >= p || j2 >= p || j3 >= p) {
					y++;
					S--;
					continue;
				}

			}

			System.out.println("Case #" + x + ": " + y);
		}
	}
}
