/*
 * 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.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashMap;
import java.util.Map;

public class ProblemB{
	
	/**
	 * @param args
	 * @throws IOException 
	 * @throws NumberFormatException 
	 */
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new FileReader("B-small-attempt0.in"));
		int count = Integer.parseInt(br.readLine());
		for (int i = 0; i<count; i++){
			String text = br.readLine();
			int result = calculate(text);
			System.out.println("Case #"+(i+1)+": "+result);
		}
		

	}

	private static int calculate(String text) {
		// TODO Auto-generated method stub
		int result = 0;
		String[] values = text.split(" ");
		int n = Integer.parseInt(values[0]);
		int t = Integer.parseInt(values[1]);
		int p = Integer.parseInt(values[2]);
		for(int i = 0; i < n; i++)
		{
			int ti = Integer.parseInt(values[i+3]);
			if ((ti/3.0)>(p-0.7)){
				result++;
			}else if (t>0 && (ti/3.0)>(p-1.4) && ti>=t ){
				t--;
				result++;
			}
		}
		return result;
	}	
}