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


    }
}

/////     put all imports here    /////////

import java.io.*;
import java.util.*;                // for system.out n stuff
import static java.lang.Math.*;    

///////////////////////////////////////////

public class Dancing {
	public static void main(String[] args) throws FileNotFoundException{
		
		//  handy scanner that everyone uses
		//  nextInt() nextLong() ect. 
	    //  these actually return int and long
		//  happy coding
		Scanner in = new Scanner(System.in);
		
		
		int NumCases = in.nextInt();
		for(int CasesDone=0; CasesDone < NumCases; CasesDone++){
			
			
			
					
			//dont forget to delete the last output from GoogleOut
			System.setOut(new PrintStream(new FileOutputStream("/Users/NathanBreitsch/Desktop/GoogleOut/StoreCreditOut", true)));
			
			
			

			int N = in.nextInt();
			int S = in.nextInt();
			int P = in.nextInt();
			
			int P1 = Math.max(0, P-1);
			int P2 = Math.max(0, P-2);
			
			
			PriorityQueue<Integer> t= new PriorityQueue<Integer>(20, new Comparator<Integer>(){
	            public int compare(Integer o1, Integer o2){
	                return o2 - o1;
	            }
	        });
			
			
			
			for (int i = 0; i < N; i++){
				t.add(in.nextInt());
			}
			
			int sup = 0;
			int max = 0;
			while((sup < S) && (!t.isEmpty())){

				
				
				if (P + 2*(P1) <= t.peek()){
					max++;
				}
				else if(P + 2*(P2) <= t.peek()){
					max ++;
					sup ++;
				}
				
				t.poll();
			}
			
			
			while(! t.isEmpty()){

				
				
				if (P + 2*(P1) <= t.peek()){
					max++;
				}
				
				t.poll();
			}
			
			
			//In Europe, the first floor is numbered zero.
			//But this is America!  Hence the +1
			System.out.print("Case #" + (CasesDone+1) + ": ");
			
			System.out.print(max);
			
			System.out.println();
			
			
		}
	}
}
