/**
 * 
 */
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();

	}

}


import java.util.Arrays;
import java.util.Scanner;

public class B {

    public static void main(String args[]) {
        Scanner in = new Scanner(System.in);
        int t = in.nextInt();
        for (int i = 0; i < t; i++) {
            int n = in.nextInt();
            int s = in.nextInt();
            int p = in.nextInt();
            int ans = 0;

            int a[] = new int[n];
            int b[] = new int[n];
            for (int j = 0; j < n; j++) {
                a[j] = in.nextInt();
                if (a[j] % 3 == 0) {
                    b[j] = a[j] / 3;
                } else if ((a[j] > 0) && (a[j] - 1) % 3 == 0) {
                    b[j] = (a[j] - 1) / 3 + 1;
                } else if ((a[j] > 1) && (a[j] - 2) % 3 == 0) {
                    b[j] = (a[j] - 2) / 3 + 1;
                }
            }
            for (int j = 0; j < n && s > 0; j++) {
                if (a[j] >= 0 && b[j] < p) {
                    int x = -1;
                    if ((a[j] > 1) && (a[j] - 2) % 3 == 0) {
                        x = (a[j] - 2) / 3 + 2;
                    } else if ((a[j] > 2) && (a[j] - 3) % 3 == 0) {
                        x = (a[j] - 3) / 3 + 2;
                    } else if ((a[j] > 3) && (a[j] - 4) % 3 == 0) {
                        x = (a[j] - 4) / 3 + 2;
                    }
                    if (x >= p) {
                        ans++;
                        a[j] = -1;
                        s--;
                    }
                }
            }
            for (int j = 0; j < n && s > 0; j++) {
                if (a[j] >= 0 && b[j] < p) {
                    int x = -1;
                    if ((a[j] > 1) && (a[j] - 2) % 3 == 0) {
                        x = (a[j] - 2) / 3 + 2;
                    } else if ((a[j] > 2) && (a[j] - 3) % 3 == 0) {
                        x = (a[j] - 3) / 3 + 2;
                    } else if ((a[j] > 3) && (a[j] - 4) % 3 == 0) {
                        x = (a[j] - 4) / 3 + 2;
                    }
                    if (x != -1) {
                        a[j] = -1;
                        s--;
                    }
                }
            }
            for (int j = 0; j < n && s > 0; j++) {
                if (a[j] >= 0 && b[j] >= p) {
                    int x = -1;
                    if ((a[j] > 1) && (a[j] - 2) % 3 == 0) {
                        x = (a[j] - 2) / 3 + 2;
                    } else if ((a[j] > 2) && (a[j] - 3) % 3 == 0) {
                        x = (a[j] - 3) / 3 + 2;
                    } else if ((a[j] > 3) && (a[j] - 4) % 3 == 0) {
                        x = (a[j] - 4) / 3 + 2;
                    }
                    if (x >= p) {
                        ans++;
                        a[j] = -1;
                        s--;
                    }
                }
            }

            for (int j = 0; j < n && s > 0; j++) {
                if (a[j] >= 0 && b[j] >= p) {
                    int x = -1;
                    if ((a[j] > 1) && (a[j] - 2) % 3 == 0) {
                        x = (a[j] - 2) / 3 + 2;
                    } else if ((a[j] > 2) && (a[j] - 3) % 3 == 0) {
                        x = (a[j] - 3) / 3 + 2;
                    } else if ((a[j] > 3) && (a[j] - 4) % 3 == 0) {
                        x = (a[j] - 4) / 3 + 2;
                    }
                    if (x != -1) {
                        ans--;
                        a[j] = -1;
                        s--;
                    }
                }
            }
            for (int j = 0; j < n; j++) {
                if (a[j] >= 0 && b[j] >= p) {
                    ans++;
                }
            }
            System.out.println("Case #"+(i+1)+": "+ans);
        }
    }
}
