/*
 * 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);
        }


    }
}


public class Dancing
{
	public static void main(String[] args)
	{
		int T = StdIn.readInt();

		for (int tr = 1; tr <= T; tr++)
		{
			int N = StdIn.readInt();
			int S = StdIn.readInt();
			int p = StdIn.readInt();

			int numP = 0;
			int numS = 0;

			for (int i = 0; i < N; i++)
			{
				int tripSum = StdIn.readInt();
				int doubSum = tripSum - p;

				if(p == 0)
				{
					numP++;
					continue;
				}


				if (doubSum >= 2*(p-1))
					numP++;
				else if (doubSum >= 2*(p-2) && p > 1)
					numS++;
			}

			int total = numP + Math.min(numS, S);

			StdOut.println("Case #" + tr + ": " + total);
		}
	}
}
