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

public class DanceWGoogle {

	public static int testcase(int S, int p, int[] arr) {
		int over = 0;
		int oneund = 0;
		int temp;
		for (int i = 0; i < arr.length; i++) {
			temp=0;
			if (arr[i] % 3 == 0) {
				temp = arr[i] / 3;
			} else {
				temp = arr[i] / 3;
				temp++;
			}
			if (temp >= p)
				over++;
			else if (temp == p - 1 && arr[i]>1)
				oneund++;
		}
		over += Math.min(S, oneund);
		return over;
	}

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int T = scan.nextInt();
		int arr[];
		for (int i = 0; i < T; i++) {
			arr = new int[scan.nextInt()];
			int S = scan.nextInt();
			int p = scan.nextInt();
			for (int a = 0; a < arr.length; a++) {
				arr[a] = scan.nextInt();
			}
			System.out.println("Case #" + (i + 1) + ": " + testcase(S, p, arr));
		}
	}
}