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

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}

import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.Collections;
import java.util.Scanner;
import java.util.Vector;


public class pbB {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner sc = new Scanner(new FileReader("test.in"));
		PrintWriter out= new PrintWriter("output.out");
		
		int k=sc.nextInt(), n,s,p,rep,sup,inf; Vector<Integer> scores;		
		for(int i=1;i<=k;i++){
			scores= new Vector<Integer>(); 
			n= sc.nextInt();s=sc.nextInt();p=sc.nextInt();
             for(int h= 0;h<n;h++) scores.add(sc.nextInt());
             Collections.sort(scores);
             rep=0; sup= p<1? p: 2*(p-1)+p; inf = p<2 ? p: 2*(p-2)+p;
             for(int h=scores.size()-1;h>=0;h--){
            	 if(scores.elementAt(h)>=sup) rep++;
            	 else if (scores.elementAt(h)>=inf && s>0){
            	    rep++;s--;
            	 }            	 
             }
		   out.print("Case #"+i+": "+rep);
		   if (i!=k) out.println();
		}
	out.close();
}
}
