import java.util.*;
public class Test {
  public static void main(String[] args){
    Scanner in = new Scanner(System.in);
    int T = in.nextInt();

    for(int i = 1; i<=T; i++) {
      int n = in.nextInt();
      int s = in.nextInt();
      int p = in.nextInt();
      int result = 0;
      for(int j = 0; j<n; j++){
        int x = canAddUp(in.nextInt(), p);
        if(x == 0) {
          result++;
        } else if (x==1 && s > 0) {
          result++;
          s--;
        }
      }
      System.out.println("Case #"+i+": "+result);
    }
  }

  public static int canAddUp(int sum, int limit) {
    boolean flag = false;
    for(int i = 0; i<=sum; i++) {
      for(int j = 0; i+j <= sum; j++) {
        int k = sum-(i+j);
        int a = Math.abs(i-j);
        int b = Math.abs(i-k);
        int c = Math.abs(j-k);
        if(a > 2 || b > 2 || c> 2){
          continue;
        }

        if (i>=limit || j>=limit || k>=limit) {
          if(a < 2 && b < 2 && c < 2) {
            return 0;
          }else{
            flag = true;
          }
        }
      }
    }
    return (flag) ? 1 : 2;
  }
}

import java.io.* ;
import java.text.DecimalFormat;
import java.util.*;
import static java.lang.Math.* ;
import static java.util.Arrays.* ;

public class B {
	
	public static void main(String[] args) throws FileNotFoundException {
		
		in = new Scanner(new InputStreamReader(new FileInputStream("b_in.txt")));
		out = new PrintStream(new BufferedOutputStream(new FileOutputStream("b_out.txt")));
		
		int n = in.nextInt() ; in.nextLine() ;
		int t = 1 ;
		while( n-- > 0)
			new B().solveProblem(t++);
		
		out.close();
	}

	static Scanner in = new Scanner(new InputStreamReader(System.in));
	static PrintStream out = new PrintStream(new BufferedOutputStream(System.out));
	

	//static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
	
	
	public void solveProblem(int nr) {	
		out.print("Case #" + nr + ": " ) ;

		int N = in.nextInt() ;
		int S = in.nextInt() ;
		int p = in.nextInt() ;
		
		int[] v = new int[N] ;
		for( int i = 0 ; i < N ; i++ )
			v[i] = in.nextInt() ;
		
		int[] min_ns = new int[31] ;
		int[] min_s = new int[31] ;
		fill( min_s, -1 );
		
		for( int i = 0 ; i <= 10 ; i++ )
			for( int j = i ; j <= i + 2 && j <= 10 ; j++ )
				for( int k = j ; k <= i + 2  && k <= 10 ; k++ ){
					min_s[i+j+k]  = max(min_s[i+j+k],k ) ;
				}
		for( int i = 0 ; i <= 10 ; i++ )
			for( int j = i ; j <= i + 1 && j <= 10 ; j++ )
				for( int k = j ; k <= i + 1  && k <= 10 ; k++ ){
					min_ns[i+j+k]  = max(min_ns[i+j+k],k ) ;
				}
		int t1 = 0 ;
		int t2 = 0 ;
		
		for( int a : v ){
			
			if( min_ns[a] >= p )
				t1++ ;
			else if( min_s[a]  >= p )
				t2++ ;
			
		}
		
		out.println(t1+min(t2,S)) ;
		System.err.println("Case #" + nr + " solved") ;
	}
	

}