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.IOException;
import java.io.InputStreamReader;

/**
 * Google code jam.
 * Qualification Round 2012.
 * Problem B. Dancing With the Googlers
 * 
 * Usage: &lt;app&gt; &lt;input &gt;output
 * 
 * @author sombrabr@gmail.com
 *
 */
public class QualB {
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		
		int cases = new Integer(in.readLine());
		
		run(in, cases);
	}
	
	static void run(BufferedReader in, int cases) throws IOException {
		for(int i=0; i<cases; ++i) {
			String line = in.readLine();

			System.out.print("Case #" + (i+1) + ": ");
			
			String[] parts = line.split(" ");
			
			int j=0;
			int N = Integer.parseInt(parts[j++]); // Number of Googlers
			int S = Integer.parseInt(parts[j++]); // Surprising triplets
			int p = Integer.parseInt(parts[j++]); // Best result base
			
			int tripletScore = p+2*(Math.max(0, p-2)); // Triplet score
			int minimumScore = p+2*(Math.max(0, p-1)); // Minimum score not a triplet
			
			int surprisings = 0; // Total surprisings already found
			
			int googlers = 0; // Count of Googlers with p
			
			for(int k=0; k<N; ++k) {
				int t = Integer.parseInt(parts[j++]); // Total score
				
				if(t>=minimumScore) {
					googlers++;
				} else if(t>=tripletScore && surprisings<S) {
					surprisings++;
					googlers++;
				}
			}
			
			System.out.println(googlers);
		}
	}
}
