/*
 * 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 B  {
	public static void main (String [] args) {
		try {
			BufferedReader br = new BufferedReader(new FileReader("B-small-0.in"));
			PrintWriter pw = new PrintWriter("B-small-0.out");
			int inputNo;
			inputNo = Integer.parseInt(br.readLine());

			for (int i = 1; i <= inputNo; i++) {
				// get one input here
				String in = br.readLine();
				pw.println("Case #" + i + ": " + processInput(in));
			}

			br.close();
			pw.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

	public static int processInput(String in) {
		int result = 0;

		Scanner sc = new Scanner(in);
		int gNo = Integer.parseInt(sc.next());
		int sup = Integer.parseInt(sc.next());
		int max = Integer.parseInt(sc.next());
		int supNo = 0;
		int goodNo = 0;

		for (int i = 0; i < gNo; i++) {
			int total = Integer.parseInt(sc.next());
			int can = canMax(max, total);
			if (can == 1) supNo++;
			if (can == 0) goodNo++;
		}

		if (supNo > sup) result = goodNo + sup;
		else result = goodNo + supNo;

		return result;
	}

	public static int canMax(int max, int total) {
		int av = total/3;
		int r = total%3;
		if (r == 0) {
			if (av >= max) return 0;
			if (av+1 >= max && av+1 <= 10 && av-1 >= 0) return 1;
			return -1;
		}
		if (r == 1) {
			if (av+1 >= max && av + 1 <= 10) return 0;
			return -1;
		}
		if (r == 2) {
			if (av+1 >= max && av+1 <= 10) return 0;
			if (av+2 >=max && av+2 <= 10) return 1;
			return -1;
		}

		return -1;
	}
}
