/**
 * 
 */
package pandit.codejam;

import java.io.BufferedInputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.Scanner;

/**
 * @author Manu Ram Pandit
 * 
 */
public class DancingWithGooglersUpload {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		FileInputStream fStream = new FileInputStream(
				"input.txt");

		Scanner scanner = new Scanner(new BufferedInputStream(fStream));
		Writer out = new OutputStreamWriter(new FileOutputStream("output.txt"));

		int T = scanner.nextInt();
		int N,S,P,ti;
		int counter = 0;
		for (int count = 1; count <= T; count++) {
			N=scanner.nextInt();
			S = scanner.nextInt();
			counter = 0;
			P = scanner.nextInt();
			for(int i=1;i<=N;i++){
				ti=scanner.nextInt();
				if(ti>=(3*P-2)){
					counter++;
					continue;
				}
				else if(S>0){
					if(P>=2 && ((ti==(3*P-3)) ||(ti==(3*P-4)))) {
					S--;
					counter++;
					continue;
					}
				}
				
			}
			// System.out.println("Case #" + count + ": " + counter);
			out.write("Case #" + count + ": " + counter + "\n");
		}
		fStream.close();
		out.close();

	}

}

/*******************************************************************************
 * Copyright (c) 2012 by Institute of Computing Technology,
 * 		Chinese Academic of Sciences, Beijing, China.
 *
 * 	Author: Ruijian Wang
 * 	  File: B.java
 * 	  Date: 2012-04-14
 * 	  Time: 13:29:55
 ******************************************************************************/

package gcj12;

import java.util.Scanner;

/**
 * Todo.
 * <p/>
 * User: Ruijian Wang
 * Date: 4/14/12
 * Time: 1:29 PM
 *
 * @author Ruijian Wang<br>
 * @version 1.0.0 2012-04-14<br>
 */
public class B {
    void solve() {
        int tCase, n, s, p;
        Scanner scan = new Scanner(System.in);
        tCase=scan.nextInt();
        for (int i = 1; i <= tCase; i++) {
            int num = 0;
            n = scan.nextInt();
            s = scan.nextInt();
            p = scan.nextInt();
            int t;
            for (int j = 0; j < n; j++) {
                t = scan.nextInt();
                int m = t % 3;
                int max = -1;
                if (m == 1) {
                    max = t / 3 + 1;
                    if (max >= p) {
                        num ++;
                    }
                } else if (m == 2) {
                    max = t / 3 + 1;
                    if (max >= p) {
                        num ++;
                    } else if (s > 0 && max + 1 >= p) {
                        s--;
                        num++;
                    }
                } else {
                    max = t / 3;
                    if (max >= p) {
                        num++;
                    } else if (s > 0 && t >= 3 && max + 1 >= p) {
                        s--;
                        num++;
                    }
                }
            }
            System.out.println("Case #" + i + ": " + num);
        }
    }

    public static void main(String[] args) {
        new B().solve();
    }
}
