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);
		
		
		
	}
}


import java.io.File;
import java.io.FileNotFoundException;
import java.util.Arrays;
import java.util.Scanner;

public class DancingGooglers {
    public static void main(String[] args) throws FileNotFoundException {
        int T;
        //Scanner sc = new Scanner(System.in);
        Scanner sc = new Scanner(new File("input.in"));
        T=sc.nextInt();

        for( int i=0;i<T;i++) {
            int N = sc.nextInt();
            int S = sc.nextInt();
            int p = sc.nextInt();
            int ti[]=new int[N];
            for(int j=0;j<N;j++) {
                ti[j]=sc.nextInt();
            }
            Arrays.sort(ti);
            int count=0;
            for(int j=N-1;j>=0;j--) {
                if(ti[j]/3>=p) {
                    count++;
                }
                else if(ti[j]==0) {
                    break;
                }
                else{
                    float temp = ((float) ti[j])/3;
                    if(p-temp<.9) {
                        count++;
                    }
                    else if(p-temp==1 || p-temp<1.4) {
                        if(S>0) {
                            count++;
                            S--;
                        }
                    }
                }
            }
            System.out.println("Case #"+(i+1)+": "+count);
        }
 
    }
}
