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.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWiththeGooglers {

	public static void main ( String [] arg ) throws IOException{
		BufferedReader reader = new BufferedReader(new FileReader(new File("input")));
		PrintWriter output = new PrintWriter(new File("output"));
		int cases = Integer.valueOf( reader.readLine() ); 
		for ( int i=1; i<=cases; i++ ){
			StringTokenizer tkn = new StringTokenizer( reader.readLine() ); 
			int N = Integer.valueOf( tkn.nextToken() ); 
			int S = Integer.valueOf( tkn.nextToken() ); 
			int p = Integer.valueOf( tkn.nextToken() ); 
			int sol=0; 
			for ( int j=0; j<N; j++){
				int points = Integer.valueOf( tkn.nextToken() ); 
				if ( ok(points,p,3) ){
					sol++;
				} else {
					if ( S>0 && ok(points,p,4) ){
						sol++;
						S--;
					}
				}
			}
			output.println("Case #"+i+": " + sol ); 
		}
		output.close(); 
	}
	
	public static boolean ok( int suma, int p, int sum_delta ){
		for ( int i=0; i<=10; i++ ){
			for ( int j=0; j<=10; j++ ){
				for ( int k=0; k<=10; k++ ){
					if ( i+j+k == suma ){
						int unu =  Math.abs(i-j);
						int doi =  Math.abs(i-k);
						int trei = Math.abs(j-k);
						if ( unu+doi+trei<=sum_delta ){
							if ( Math.max( Math.max(i, j), k )>=p){
								return true; 
							}
						}
					}
				}
			}
		}
		return false; 
	}
	
}
