import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package codejam2012;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

/**
 *
 * @author Rumal
 */
public class QB {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws IOException {
        Scanner sc = new Scanner(System.in);
//        TreeSet<Integer> 
//        for (int i = 0; i <= 10; i++) {
//            for (int j = Math.max(i-1,0); j < 10 && j<=i+1 ; j++) {
//                for (int k = Math.max(i-1,0); k < 10 && k<=i+1 ; k++) {
//                    
//                }
//            }
//        }
//        
        
        
        
        int T = sc.nextInt();
        for (int t = 1; t <= T; t++) {
            int ans = 0;
            int N = sc.nextInt();
            int S = sc.nextInt();
            int p = sc.nextInt();
            int[] gg = new int[N];
            for (int i = 0; i < N; i++) {
                gg[i] = sc.nextInt();
            }
            Arrays.sort(gg);
            //System.out.println(Arrays.toString(gg));
            int minSc = (2) * (p - 1) + p;
            int minSp = (2) * (p - 2) + p;
            minSc = Math.max(minSc, 0);
            minSp = Math.max(minSp, 2);
            //System.out.println(minSc+" "+minSp);
            for (int i : gg) {
                if (i >= minSc) {
                    //System.out.println(i);
                    ans++;
                    continue;
                }
                if (i >= minSp && S-- > 0) {
                    //System.out.println("*"+i);
                    ans++;
                    continue;
                }
                //System.out.println(i);
            }


            System.out.println("Case #" + t + ": " + ans);
        }
    }
}
