import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

import java.io.File;
import java.io.PrintWriter;

import java.util.HashSet;
import java.util.Scanner;

/**
 * User: Sasha
 * Date: 09.04.12
 * Time: 19:13
 */
public class Main {
    private Scanner sc;
    private PrintWriter wr;
    private HashSet<String> set;

    private void prepare() throws Exception {
        sc = new Scanner(new File("C:\\Projects\\B-small-attempt2.in"));
        File file = new File("C:\\Projects\\out.txt");
        wr = new PrintWriter(file);
//        wr = new PrintWriter(System.out);
    }
    
    private void solve() {
        int T = sc.nextInt();

        for (int i = 0; i < T; ++i) {
            set = new HashSet<String>();

            wr.print(String.format("Case #%d: ", (i + 1)));

            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();

            int r[] = new int[n];
            for (int j = 0; j < r.length; ++j)
                r[j] = sc.nextInt();
            
            int res = 0;
            
            for (int j = 0; j < n; ++j) {
                int e = r[j] / 3;
                int k = r[j] - e * 3;
                
                if (e >= p) {
                    ++res;
                } else if (k >= 1 && e + 1 >= p) {
                    ++res;
                } else if (k == 0 && e + 1 >= p && s > 0 && e > 0) {
                    ++res;
                    --s;
                }
                else if (k == 2 && e + 2 >= p && s > 0) {
                    ++res;
                    --s;
                }

            }
            wr.println(res);
        }

        wr.flush();
    }

    public static void main(String args[]) throws Exception {
        Main main = new Main();
        
        main.prepare();
        
        main.solve();
    }
}
