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


    }
}

package code.google.com;

import java.util.Scanner;

public class problemB {

	public static void main(String[] Args) {
		Scanner sc = new Scanner(System.in);
		int tests = sc.nextInt();
		int n, s, p;

		sc.nextLine();

		for (int i = 1; i <= tests; i++) {
			int t;
			int count = 0;
			int uCount = 0;
			n = sc.nextInt();
			s = sc.nextInt();
			p = sc.nextInt();

			for (int j = 1; j <= n; j++) {
				t = sc.nextInt();
				if (suprise(t) >= p && unsuprise(t) >= p)
					count++;
				else if (suprise(t) >= p)
					count++;
				else if (unsuprise(t) >= p)
					uCount++;
			}

			if (s < uCount)
				uCount = s;

			System.out.println("Case #" + i + ": " + (count + uCount));
			sc.nextLine();

		}

	}

	public static int max(int a, int b, int c) {
		int max = Integer.MIN_VALUE;

		if (a > max)
			max = a;
		if (b > max)
			max = b;
		if (c > max)
			max = c;

		return max;
	}

	public static int suprise(int t) {

		int dim;

		dim = t / 3;

		if (t == 0)
			return 0;
		if (t == 30)
			return 30;

		if (dim > 0) {
			int p;

			p = (dim + 1) + (dim + 1) + (dim);
			if (p == t)
				return max((dim + 1), (dim + 1), (dim));
			p = (dim + 1) + (dim) + (dim);
			if (p == t)
				return max((dim + 1), (dim), (dim));
			p = (dim) + (dim) + (dim);
			if (p == t)
				return max((dim), (dim), (dim));
			p = (dim - 1) + (dim) + (dim);
			if (p == t)
				return max((dim - 1), (dim), (dim));
			p = (dim - 1) + (dim - 1) + (dim);
			if (p == t)
				return max((dim - 1), (dim - 1), (dim));

		} else
			return 1;

		return -1;
	}

	public static int unsuprise(int t) {
		int dim;
		int p;

		dim = t / 3;

		if (t == 0)
			return 0;
		if (t == 30)
			return 30;

		if (dim > 1 && dim < 9) {

			p = (dim + 2) + (dim + 1) + (dim);
			if (p == t)
				return max((dim + 2), (dim + 1), (dim));
			p = (dim + 2) + (dim + 2) + (dim);
			if (p == t)
				return max((dim + 2), (dim + 2), (dim));
			p = (dim + 2) + (dim) + (dim);
			if (p == t)
				return max((dim + 2), (dim), (dim));
			p = (dim - 2) + (dim - 1) + (dim);
			if (p == t)
				return max((dim - 2), (dim - 1), (dim));
			p = (dim - 2) + (dim) + (dim);
			if (p == t)
				return max((dim - 2), (dim), (dim));
			p = (dim - 2) + (dim - 2) + (dim);
			if (p == t)
				return max((dim - 2), (dim - 2), (dim));
			p = (dim - 1) + (dim + 1) + (dim);
			if (p == t)
				return max((dim - 1), (dim + 1), (dim));

		}

		if (dim <= 1) {

			p = (dim + 2) + (dim) + (dim);
			if (p == t)
				return max((dim + 2), (dim), (dim));
			p = (dim + 2) + (dim + 2) + (dim);
			if (p == t)
				return max((dim + 2), (dim + 2), (dim));
			p = (dim + 2) + (dim + 1) + (dim);
			if (p == t)
				return max((dim + 2), (dim + 1), (dim));

			if (dim == 1) {
				p = (dim - 1) + (dim + 1) + (dim);
				if (p == t)
					return max((dim - 1), (dim + 1), (dim));
			}

		}

		if (dim >= 9) {

			p = (dim - 2) + (dim - 2) + (dim);
			if (p == t)
				return max((dim - 2), (dim - 2), (dim));
			p = (dim - 2) + (dim) + (dim);
			if (p == t)
				return max((dim - 2), (dim), (dim));
			p = (dim - 2) + (dim - 1) + (dim);
			if (p == t)
				return max((dim - 2), (dim - 1), (dim));

			if (dim == 9) {
				p = (dim - 1) + (dim + 1) + (dim);
				if (p == t)
					return max((dim - 1), (dim + 1), (dim));
			}

		}

		return -1;
	}
}
