/*
 * 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 B {
	private static Scanner sc;
	
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		int t = sc.nextInt();
		for (int i = 0; i < t; i++) System.out.printf("Case #%d: %d\n", i + 1, exec());
	}
	
	public static int exec() {
		int n = sc.nextInt();
		int s = sc.nextInt();
		int p = sc.nextInt();
		int[] t = new int[n];
		for (int i = 0; i < n; i++) {
			t[i] = sc.nextInt();
		}
		
		int definitelyPossible = Math.max(0, p * 3 - 2);
		int onlyForSpecial = Math.max(0, definitelyPossible - 2);
		
		int count = 0;
		int left = s;
		for (int i = 0; i < n; i++) {
			if (t[i] == 0) count += p == 0 ? 1 : 0;
			else if (t[i] == 1) count += p <= 1 ? 1 : 0;
			else if (t[i] == 2 && p < 2) count++;
			else if (t[i] == 2 && p > 2) ;
			else if (t[i] == 2 && left > 0) {
				left--;
				count++;
			}
			else if (t[i] == 3 && p < 2) count++;
			else if (t[i] == 3 && p > 2) ;
			else if (t[i] == 3 && left > 0) {
				left--;
				count++;
			}
			else if (t[i] >= definitelyPossible) count++;
			else if (t[i] >= onlyForSpecial && left > 0) {
				left--;
				count++;
			}
		}
		
		return count;
	}
}
